This paper addresses scheduling models in which a contribution of an individual job to the objective function is … and demonstrate that a linear assignment algorithm as part of previously known solution procedures can be replaced by a … faster matching algorithm that minimizes a linear form over permutations. Our approach reduces the running time of the …

This paper deals with energy-related job scheduling for a foundry, in order to minimise the electricity bill …

This paper considers the scheduling problems with the objective of minimizing the total completion time on two parallel …, which is the smallest possible worst-case ratio that an polynomial time algorithm can have unless P=NP. …

This paper considers the hybrid flow shop scheduling problem. Most real world scheduling problems are NP-hard in nature … with 'k' stage is solved by Gantt chart method which gives an active feasible schedule. A simulated annealing algorithm is … proposed in this paper to find a better/optimal or near optimal schedule. This technique reveals that the proposed algorithm is …

A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs …

A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs …

The majority of the papers dealing with scheduling deteriorating jobs ignores general deterioration forms, and …

by water depth and tidal condition. We model the problem as a parallel-machine scheduling problem with inclusive …

Majority of parallel machine scheduling studies consider machine as the only resource. However, in most real … studies on the parallel machine scheduling problems with additional resources. Papers are surveyed in five main categories …