Two decompositions for the bicriteria job-shop scheduling problem with discretely controllable processing times

References

• Agnetis , A . 1997 . Joint job/tool scheduling in a flexible manufacturing cell with no on-board tool magazine . Computer Integrated Manufacturing Systems , 10 ( 1 ) : 61 – 68 .
   Google Scholar
• Alfieri , A and Brandimarte , P . 1997 . Job shop scheduling with delay-renewable resources: a comparison of decomposition strategies . International Journal of Production Research , 35 ( 7 ) : 1807 – 1824 .
   Web of Science ®Google Scholar
• Artigues , C . 2009 . Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound . Computers & Operations Research , 36 ( 8 ) : 2330 – 2340 .
   Web of Science ®Google Scholar
• Beasley , JE . 1990. Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 1069–1072
   Google Scholar
• Brandimarte , P . 1993 . Routing and scheduling in a flexible job shop by tabu search . Annals of Operations Research , 41 ( 3 ) : 157 – 183 .
   Google Scholar
• Cheng , R , Gen , M and Tsujimura , Y . 1996 . A tutorial survey of job-shop scheduling problems using genetic algorithms – i. Representation . Computers & Industrial Engineering , 30 ( 4 ) : 983 – 997 .
   Web of Science ®Google Scholar
• Choi , B-C , Leung , JYT and Pinedo , ML . 2010 . Complexity of a scheduling problem with controllable processing times . Operations Research Letters , 38 ( 2 ) : 123 – 126 .
   Web of Science ®Google Scholar
• Da Silva , CRN and Morabito , R . 2009 . Performance evaluation and capacity planning in a metallurgical job-shop system using open queueing network models . International Journal of Production Research , 47 ( 23 ) : 6589 – 6609 .
   Web of Science ®Google Scholar
• Grabowski , J and Janiak , A . 1987 . Job-shop scheduling with resource-time models of operations . European Journal of Operational Research , 28 ( 1 ) : 58 – 73 .
   Web of Science ®Google Scholar
• Graham , R . 1979 . “ Optimization and approximation in deterministic sequencing and scheduling: A survey ” . In Annals of Discrete Mathematics , Edited by: Hammer , PL . 287 – 326 . Amsterdam : Elsevier .
   Google Scholar
• Janiak , A , Janiak , W and Lichtenstein , M . 2007 . Resource management in machine scheduling problems: A survey . Decision Making in Manufacturing and Services , 1 ( 1–2 ) : 59 – 89 .
   Google Scholar
• Janiak , T . 1994 . Job-shop scheduling with convex models of operations . Mathematical and Computer Modelling , 20 ( 2 ) : 59 – 68 .
   Web of Science ®Google Scholar
• Jansen , K , Mastrolilli , M and Solis-Oba , R . 2005 . Approximation schemes for job shop scheduling problems with controllable processing times . European Journal of Operational Research , 167 ( 2 ) : 297 – 319 .
   Web of Science ®Google Scholar
• Kellerer , H and Strusevich , V . 2003a . Scheduling parallel dedicated machines under a single non-shared resource . European Journal of Operational Research , 147 ( 2 ) : 345 – 364 .
   Web of Science ®Google Scholar
• Kellerer , H and Strusevich , V . 2003b . Scheduling problems for parallel dedicated machines under multiple resource constraints . Discrete Applied Mathematics , 133 ( 1–3 ) : 45 – 68 .
   Web of Science ®Google Scholar
• Kellerer , H and Strusevich , V . 2008 . Scheduling parallel dedicated machines with the speeding-up resource . Naval Research Logistics , 55 ( 5 ) : 377 – 389 .
   Web of Science ®Google Scholar
• Lawrence , S . 1984. Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Technical report. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA
   Google Scholar
• Lee , D-H and Yeong-Dae , K . 1999 . Scheduling algorithms for flexible manufacturing systems with partially grouped machines . Journal of Manufacturing Systems , 18 ( 4 ) : 301 – 309 .
   Web of Science ®Google Scholar
• Lei , DM . 2010 . A genetic algorithm for flexible job shop scheduling with fuzzy processing time . International Journal of Production Research , 48 ( 10 ) : 2995 – 3013 .
   Web of Science ®Google Scholar
• Mokhtari , H . 19 . Abadi, I.N.K., and Cheraghalikhani, A., 2011. A multi-objective flow shop scheduling with resource-dependent processing times: Trade-off between makespan and cost of resources. International Journal of Production Research, 49 , 5851–5875
   Google Scholar
• Niu , G . et al., 2010. A decomposition algorithm for bicriteria job-shop scheduling problem with discretely controllable processing times. 1st International Conference on Computing Control and Industrial Engineering, CCIE 2010, 5–6 June, Wuhan, China. Washington, DC: IEEE Computer Society, 204–207
   Google Scholar
• Niu , G . 2011 . A decomposition approach to job-shop scheduling problem with discretely controllable processing times . SCIENCE CHINA Technological Sciences , 54 ( 5 ) : 1240 – 1248 .
   Web of Science ®Google Scholar
• Payne , A and Polak , E . 1980 . An interactive rectangle elimination method for biobjective decision making . IEEE Transactions on Automatic Control , 25 ( 3 ) : 421 – 432 .
   Web of Science ®Google Scholar
• Payne , AN . 1993 . Efficient approximate representation of bi-objective tradeoff sets . Journal of the Franklin Institute , 330 ( 6 ) : 1219 – 1233 .
   Web of Science ®Google Scholar
• Ruzika , S and Wiecek , M . 2005 . Approximation methods in multiobjective programming . Journal of Optimization Theory and Applications , 126 ( 3 ) : 473 – 501 .
   Web of Science ®Google Scholar
• Shabtay , D and Steiner , G . 2007 . A survey of scheduling with controllable processing times . Discrete Applied Mathematics , 155 ( 13 ) : 1643 – 1666 .
   Web of Science ®Google Scholar
• Solanki , R . 1991 . Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem . Computers & Operations Research , 18 ( 1 ) : 1 – 15 .
   Web of Science ®Google Scholar
• Upasani , A and Uzsoy , R . 2008 . Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: A simulation study . International Journal of Production Research , 46 ( 21 ) : 5883 – 5905 .
   Web of Science ®Google Scholar
• Zhang , C . 2007 . A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem . Computers & Operations Research , 34 ( 11 ) : 3229 – 3242 .
   Web of Science ®Google Scholar
• Zitzler , E and Thiele , L . 1999 . Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach . IEEE Transactions on Evolutionary Computation , 3 ( 4 ) : 257 – 271 .
   Web of Science ®Google Scholar