Scheduling Analysis

634 Words3 Pages
Scheduling is to simply assign a set of jobs to a set of machines with respect to operational constraints such that optimal usage of available resources is obtained. Because of the growing cost of raw material, labour, energy and transportation, scheduling plays an essential role in planning and operation of manufacturing systems, and it is one of the most important issues for survival in the modern competitive market place.
Scheduling jobs on unrelated parallel machines are common in many manufacturing environments, such as in semiconductor manufacturing (Kim et al. [1] , Wang et al. [2]), the spinning of acrylic fibers for production in the textile industry Silva and Magalhaes [3], in steel making industry Pan et al. [4], the preheat treatment stage of automobile gear manufacturing process Gokhale and Mathirajan [5], block transportation in shipyard Hu et al. [6], and scheduling jobs in a printed wiring board (PWB) manufacturing environment (Yu et al. [7], Bilyk and Mönch [8]).
Hurink and Knust [9], considered identical parallel machines scheduling problem (PMSP) with precedence constraints and sequence dependent setup times, They dealt with the question whether it is possible to design an efficient list scheduling algorithm to minimize makespan for this problem. Kim et al. [10], considered PMSP with s-precedence constraints to minimize total completion time. They developed a heuristic algorithm for solving this problem. Tavakkoli-Moghaddam et al. [11] presented a two-level mixed-integer programming model for bi-objective unrelated PMSP with release dates, precedence constraints and sequence dependent setup times to minimize the number of tardy jobs and sum of completion times, the model is solved by a genet...

... middle of paper ...

...vailability and eligibility constraints while minimizing the maximum lateness. Gokhale and Mathirajan [5] addressed identical parallel machines scheduling problem for minimizing total weighted flowtime with release dates, machine eligibility restrictions and sequence dependent setup times, they presented a mathematical model and a few heuristic algorithms have been suggested to solve this model. A mixed-integer programming model and local search heuristics are proposed by Wang et al. [2], for unrelated (PMSP) incorporating release dates, machine eligibility restrictions and sequence dependent setup times. As indicated, none of these works take into account precedence constraints. Hu et al. [6] considered machine eligibility and precedence constraints for identical (PMSP) simultaneously, however, they did not consider release dates and sequence dependent setup times.

More about Scheduling Analysis

Open Document