A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resources

References

• Baker , KR . 1974 . Introduction to sequencing and scheduling , New York : Wiley .
   Google Scholar
• Bean , JC . 1994 . Genetic algorithm and random keys for sequencing and optimization . ORSA Journal on Computing , 6 ( 2 ) : 154 – 160 .
   Google Scholar
• Bertolissi , E . 2000 . Heuristic algorithm for scheduling in the no-wait flow shop . Journal of Materials Processing Technology , 107 ( 1–3 ) : 459 – 465 .
   Web of Science ®Google Scholar
• Bulfin , RL and Hallah , M . 2003 . Minimizing the weighted number of tardy jobs on a two-machine flow shop . Computer and Operations Research , 30 ( 12 ) : 1887 – 1900 .
   Web of Science ®Google Scholar
• Campbell , HG , Dudek , RA and Smith , ML . 1970 . A heuristic algorithm for the n job, m machine scheduling problem . Management Science , 16 ( 10 ) : B-630 – B-637 .
   Web of Science ®Google Scholar
• Carlier , J . 1978 . Ordonnancements a contraintes disjonctives . Recherche operationelle/Operations Research , 12 ( 4 ) : 333 – 351 .
   Web of Science ®Google Scholar
• Cevik , A . 2010 . A new formulation for longitudinally stiffened webs subjected to patch loading using stepwise regression method . Advances in Engineering Software , 41 ( 4 ) : 611 – 618 .
   Google Scholar
• Cheng , TCE , Janiak , A and Kovalyov , MY . 2001 . Single machine batch scheduling with resource dependent setup and processing times . European Journal of Operational Research , 135 ( 1 ) : 177 – 183 .
   Google Scholar
• Choi , BC , Leung , JY-T 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
• Choi , B , Yoon , S and Chung , S . 2007a . Minimizing maximum completion time in a proportionate flow shop with one machine of different speed . European Journal of Operational Research , 176 ( 2 ) : 964 – 974 .
   Web of Science ®Google Scholar
• Choi , B-C , Yoon , S-H and Chung , S-J . 2007b . Single machine scheduling problem with controllable processing times and resource dependent release times . European Journal of Operational Research , 181 ( 2 ) : 645 – 653 .
   Google Scholar
• Framinan , JM , Leisten , R and Ruiz-Usano , R . 2002 . Efficient heuristics for flowshop sequencing with objectives of makespan and flowtime minimization . European Journal of Operational Research , 141 ( 3 ) : 561 – 571 .
   Google Scholar
• Gupta , JND and Stafford , EF . 2006 . Flow shop scheduling research after five decades . European Journal of Operational Research , 169 ( 3 ) : 699 – 711 .
   Web of Science ®Google Scholar
• Grabowski , J and Pempera , J . 2005 . Some local search algorithms for no-wait flow-shop problem with makespan criterion . Computer and Operations Research , 32 ( 8 ) : 2197 – 2212 .
   Web of Science ®Google Scholar
• Hansen , P , Mladenovic , N and Urosevic , D . 2006 . Variable neighborhood search and local branching . Computers and Operations Research , 33 ( 10 ) : 3034 – 3045 .
   Web of Science ®Google Scholar
• Haq , AN . 2010 . A hybrid neural network-genetic algorithm approach for permutation flow shop scheduling . International Journal of Production Research , 48 ( 14 ) : 4217 – 4231 .
   Web of Science ®Google Scholar
• Hoogeveen , H and Woeginger , GJ . 2002 . Some comments on sequencing with controllable processing times . Computing , 68 ( 2 ) : 181 – 192 .
   Google Scholar
• Huang , J-Y and Yao , M-J . 2008 . A genetic algorithm for solving the economic lot scheduling problem in flow shops . International Journal of Production Research , 46 ( 14 ) : 3737 – 3761 .
   Web of Science ®Google Scholar
• Hundal , TS and Rajgopal , J . 1988 . An extension of Palmer's heuristic for flowshop scheduling problem . International Journal of Production Research , 26 ( 6 ) : 1119 – 1124 .
   Web of Science ®Google Scholar
• Iwanowski , D and Janiak , A . 2002 . Optimal resource allocation for single machine scheduling problems with time and resource dependent processing times . Systems Science , 28 ( 2 ) : 85 – 94 .
   Google Scholar
• Janiak , A . 1989 . Minimization of the blooming mill standstills-mathematical model, suboptimal algorithms . Mechanika , 8 ( 2 ) : 37 – 49 .
   Google Scholar
• Janiak , A , Kovalyov , MY and Portmann , M-C . 2005 . Single machine group scheduling with release dependent setup and processing times . European Journal of Operational Research , 162 ( 1 ) : 112 – 121 .
   Web of Science ®Google Scholar
• Johnson , SM . 1954 . Optimal two- and three-stage production schedules with setup times included . Naval Research Logistics Quarterly , 1 ( 1 ) : 61 – 68 .
   Google Scholar
• Kaspi , M and Shabtay , D . 2006 . A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates . Computers and Operations Research , 33 ( 10 ) : 3015 – 3033 .
   Google Scholar
• King , JR and Spachis , AS . 1980 . Heuristics for flowshop scheduling . International Journal of Production Research , 18 ( 3 ) : 343 – 57 .
   Web of Science ®Google Scholar
• Lee , CY and Lei , L . 2001 . Multiple-project scheduling with controllable project duration and hard resource constraint: some solvable cases . Annals of Operations Research , 102 ( 1–4 ) : 287 – 307 .
   Web of Science ®Google Scholar
• Mladenovic , N and Hansen , P . 1997 . Variable neighborhood search . Computers and Operations Research , 24 ( 11 ) : 1097 – 1100 .
   Web of Science ®Google Scholar
• Nawaz , M , Enscore , E Jr and Ham , I . 1983 . A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem . OMEGA , 11 ( 1 ) : 91 – 95 .
   Web of Science ®Google Scholar
• Neter , J . 1996 . Applied linear regression models , Chicago, IL : Irwin .
   Google Scholar
• Ng , CTD . 2003 . Single machine scheduling with a variable common due date and resource-dependent processing times . Computers & Operations research , 30 ( 8 ) : 1173 – 1185 .
   Web of Science ®Google Scholar
• Ng , CT . 2005 . Group scheduling with controllable setup and processing times: minimizing total weighted completion time . Annals of Operations Research , 133 ( 1–4 ) : 163 – 174 .
   Google Scholar
• Onwubolu , G and Davendra , D . 2006 . Scheduling flow shops using differential evolution algorithm . European Journal of Operational Research , 171 ( 2 ) : 674 – 692 .
   Web of Science ®Google Scholar
• Palmer , DS . 1965 . Sequencing jobs through a multi-stage process in the minimum total time – a quick method of obtaining a near optimum . Operational Research Quarterly , 16 ( 1 ) : 101 – 107 .
   Google Scholar
• Pan , JCH , Chen , JS and Chao , CM . 2002 . Minimizing tardiness in a two-machine flow-shop . Computer & Operations Research , 29 ( 7 ) : 869 – 885 .
   Web of Science ®Google Scholar
• Pan , Q-K , Wang , L and Qian , B . 2009 . A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems . Computers & Operations Research , 36 ( 8 ) : 2498 – 2511 .
   Web of Science ®Google Scholar
• Perez , JAM , Vega , JMM and Martin , IR . 2003 . Variable neighborhood tabu search and its application to the median cycle problem . European Journal of Operational Research , 151 ( 2 ) : 365 – 378 .
   Web of Science ®Google Scholar
• Qian , B . 2008 . A hybrid differential evolution method for permutation flow-shop scheduling . International Journal of Advanced Manufacturing Technology , 38 ( 1 ) : 757 – 777 .
   Google Scholar
• Qian , B . 2009 . An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers . Computers & Operations Research , 36 ( 7–8 ) : 209 – 233 .
   Google Scholar
• Ravindran , D . 2005 . Flow shop scheduling with multiple objective of minimizing makespan and total flow time . International Journal of Advance Manufacturing Technology , 25 ( 9–10 ) : 1007 – 1012 .
   Google Scholar
• Rajendran , C . 1995 . Heuristics for scheduling in flowshop with multiple objectives . European Journal of Operational Research , 82 ( 3 ) : 540 – 555 .
   Web of Science ®Google Scholar
• Rahimi-Vahed , AR and Mirghorbani , SM . 2007 . A multi-objective particle swarm for a flow shop scheduling problem . Journal of Combinatorial Optimization , 13 ( 1 ) : 79 – 102 .
   Web of Science ®Google Scholar
• Reeves , CR . 1995 . A genetic algorithm for flow shop sequencing . Computers & Operations Research , 22 ( 1 ) : 5 – 11 .
   Web of Science ®Google Scholar
• Shabtay , D , Kaspi , M and Steiner , G . 2007 . The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times . IIE Transactions , 39 ( 5 ) : 539 – 557 .
   Web of Science ®Google Scholar
• Shabtay , D and Steiner , G . 2007a . Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine . Manufacturing & Service Operations Management , 9 ( 3 ) : 332 – 350 .
   Web of Science ®Google Scholar
• Shabtay , D and Steiner , G . 2007b . Single machine batch scheduling to minimize total completion time and resource consumption costs . Journal of Scheduling , 10 ( 4–5 ) : 255 – 261 .
   Google Scholar
• Storn , R and Price , KV . 1997 . Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces . Journal of Global Optimization , 2 ( 4 ) : 341 – 359 .
   Google Scholar
• Taillard , E . 1993 . Benchmarks for basic scheduling problems . European Journal of Operational Research , 64 ( 2 ) : 278 – 285 .
   Web of Science ®Google Scholar
• Tavakkoli-Moghaddam , R , Rahimi-Vahed , A and Mirzaei , AH . 2007 . A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness . Information Sciences , 177 ( 22 ) : 5072 – 5090 .
   Web of Science ®Google Scholar
• Thornton , HW and Hunsucker , JL . 2004 . A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage . European Journal of Operational Research , 152 ( 1 ) : 96 – 114 .
   Google Scholar
• T’kindt , V , Gupta , JND and Billaut , JC . 2003 . Two-machine flowshop scheduling with a secondary criterion . Computers and Operations Research , 30 ( 4 ) : 505 – 526 .
   Google Scholar
• Tseng , C-T and Liao , C-J . 2008 . A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks . International Journal of Production Research , 46 ( 17 ) : 4655 – 4670 .
   Web of Science ®Google Scholar
• Vickson , RG . 1980 . Two single-machine sequencing problems involving controllable processing times . AIIE Transactions , 12 ( 3 ) : 258 – 262 .
   Web of Science ®Google Scholar
• Widmer , M and Hertz , A . 1989 . A new heuristic method for the flowshop sequencing problem . European Journal of Operational Research , 41 ( 2 ) : 186 – 193 .
   Web of Science ®Google Scholar
• Wang , J . 2006 . Minimizing total completion time in a two-machine flow shop with deteriorating jobs . Applied Mathematics and Computation , 180 ( 1 ) : 185 – 193 .
   Web of Science ®Google Scholar
• Xu , K , Feng , Z and Jun , K . 2010 . A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates . Computers & Operations Research , 37 ( 11 ) : 1924 – 1938 .
   Web of Science ®Google Scholar
• Xu , J and Zhou , X . 2009 . A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem . Information Sciences , 179 ( 17 ) : 2997 – 3017 .
   Web of Science ®Google Scholar
• Yang , T , Kuo , Y and Chang , I . 2004 . Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors – a case study . International Journal of Production Research , 42 ( 19 ) : 4015 – 4030 .
   Web of Science ®Google Scholar
• Yeh , WC . 2002 . A memetic algorithm for the n/2/Flowshop/αF + βC max scheduling problem . International Journal of Advanced Manufacturing Technology , 20 ( 6 ) : 464 – 473 .
   Google Scholar
• Ying , K-C and Lin , S-W . 2006 . Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach . International Journal of Production Research , 44 ( 16 ) : 3161 – 3177 .
   Web of Science ®Google Scholar
• Zandieh , M and Gholami , M . 2009 . An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns . International Journal of Production Research , 47 ( 24 ) : 6999 – 7027 .
   Web of Science ®Google Scholar