Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times

International Journal of Production Economics

Volumn 135, Issue 2, 2012, Pages 953-963

  Mehravaran, Yasaman ^a   Logendran, Rasaratnam ^a  

^a Oregon State University   (United States)

Author keywords

Bicriteria; Flowshop; Mixed integer linear programming; Non permutation scheduling; Sequence dependent setup time; Tabu search with embedded progressive perturbations

Indexed keywords

ALGORITHMIC SOLUTIONS; BI-CRITERIA; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; MACHINE AVAILABILITY; METASEARCH; MIXED INTEGER LINEAR PROGRAMMING; NON-PERMUTATION FLOWSHOP; NP-HARD; OPERATIONAL CONSTRAINTS; OPERATIONAL REQUIREMENTS; OPTIMAL SCHEDULE; OPTIMAL SOLUTIONS; PERMUTATION SCHEDULES; PROBLEM INSTANCES; SEARCH ALGORITHMS; SEQUENCE-DEPENDENT SETUP TIME; SERVICE LEVELS; WORK-IN-PROCESS INVENTORY;

INTEGER PROGRAMMING; LEARNING ALGORITHMS; MACHINE SHOPS; MATHEMATICAL MODELS; SUPPLY CHAINS; TABU SEARCH;

PROBLEM SOLVING;

EID: 84155171297     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2011.11.011     Document Type: Article

References (20)

1. R. Aggoune, and M.C. Portmann Flow shop scheduling problem with limited machine availability: a heuristic approach International Journal of Production Economics 99 12 2006 4 15 (Pubitemid 41550206)
2. V.A. Armentano, and D.P. Ronconi Tabu search for total tardiness minimization in flowshop scheduling problems Computers and Operations Research 26 3 1999 219 235 (Pubitemid 29346473)
3. F. Choua, and C. Lee Two-machine flowshop scheduling with bicriteria problem Computers & Industrial Engineering 36 3 1999 549 564 (Pubitemid 129304001)
4. T. Eren, and E. Güner A bicriteria scheduling with sequence-dependent setup times Applied Mathematics and Computation 179 1 2006 378 385 (Pubitemid 44247123)
5. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Mathematics of Operations Research 2 2 1976 117 129
6. IBM, 2009. ILOG CPLEX Optimization Studio 12.2.
7. M. Koksalan, and A. Burak Keha Using genetic algorithms for single-machine bicriteria scheduling problems European Journal of Operational Research 145 3 2003 543 556 (Pubitemid 35411805)
8. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker Complexity of machine scheduling problems Annals of Discrete Mathematics 1 1977 343 362
9. L.M. Liao, and C.J. Huang Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness Applied Mathematics and Computation 217 2 2010 557 567
10. R. Logendran, and F. Subur Unrelated parallel machine scheduling with job splitting IIE Transactions 36 4 2004 359 372
11. R. Logendran, B. McDonell, and B. Smucker Scheduling unrelated parallel machine with sequence-dependent setups Computers and Operations Research 34 11 2007 3420 3438 (Pubitemid 46517865)
12. A. Mansouri, H. Hendizadeh, and N. Salmasi Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times International Journal of Advanced Manufacturing Technology 40 11 2009 1216 1226
13. D.C. Montgomery Design and Analysis of Experiments 2009 Wiley New York
14. G. Moslehi, M. Mirzaee, M. Vasei, M. Modarres, and A. Azaron Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness International Journal of Production Economics 122 2 2009 763 773
15. Oakdale Engineering, 1995. DATAFIT, Version 7.1.44.
16. G. Onwubolu, and D. Davendra Scheduling flow shops using differential evolution algorithm European Journal of Operational Research 171 2 2006 674 692 (Pubitemid 41706221)
17. R. Ruiz, and C. Maroto A comprehensive review and evaluation of permutation flowshop heuristics European Journal of Operational Research 165 2 2005 479 494 (Pubitemid 40206377)
18. B.N. Srikar, and S. Ghosh A MILP model for the n-job, m-stage flowshop with sequence dependent set-up times International Journal of Production Research 24 6 1986 1459 1474 (Pubitemid 17481862)
19. Stat Point Technologies INC.; 2010. STATGRAPHICS Centurion XVI, Version 16.1.02.
20. K.C. Ying Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic International Journal of Advanced Manufacturing Technology 38 34 2008 348 354