A Decomposition Algorithm for Bicriteria Job-Shop Scheduling Problem with Discretely Controllable Processing Times

The job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is formulated. A decomposition strategy is applied so that the problem could be solved by solving a classical JSP problem and a series of discrete time-cost tradeoff problems. Based on the partition of the solution space and the appliance of the set dominance, an extreme mode based set dominant decomposition (EMSDD) algorithm is proposed. It is proved that the solution space of JSP-DCPT could be reduced by restricting the makespan to an upper bound value which is derived by EMSDD.

[1]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[2]  Yeong-Dae Kim,et al.  Scheduling algorithms for flexible manufacturing systems with partially grouped machines , 1999 .

[3]  John W. Fowler,et al.  Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops , 2007, Eur. J. Oper. Res..

[4]  LIUMin,et al.  An Iterative Layered Tabu Search Algorithm for Complex Job Shop Scheduling Problem , 2005 .

[5]  J.W. Fowler,et al.  Heuristics for minimizing total weighted tardiness in complex job shops , 2005 .

[6]  Ping-Feng Pai,et al.  Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem , 2008 .

[7]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[8]  Alessandro Agnetis,et al.  Joint job/tool scheduling in a flexible manufacturing cell with no on-board tool magazine , 1997 .

[9]  Michel Gendreau,et al.  Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound , 2009, Comput. Oper. Res..

[10]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[11]  Fatima Ghedjati,et al.  Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: heuristic mixing method machines and precedence , 1999 .

[12]  M. Sacramento Quintanilla,et al.  A tabu search approach to machine scheduling , 1998, Eur. J. Oper. Res..

[13]  Andrea Rossi,et al.  A hybrid heuristic to solve the parallel machines job-shop scheduling problem , 2009, Adv. Eng. Softw..