Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times

International Journal of Production Economics

Volumn 103, Issue 1, 2006, Pages 386-400

  Allahverdi, Ali ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Bounded processing times; Bounded setup times; Dominance relations; Flowshop; Scheduling

Indexed keywords

COMPUTATIONAL METHODS; NUMERICAL ANALYSIS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; PRODUCTION CONTROL; RANDOM PROCESSES;

BOUNDED PROCESSING TIMES; BOUNDED SETUP TIMES; DOMINANCE RELATIONS; FLOWSHOP; PROCESSING TIMES;

SCHEDULING;

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

References (15)

1. Allahverdi A. Minimizing mean flowtime in a two-machine flowshop with sequence independent setup times. Computers and Operations Research 27 (2000) 111-127
2. Allahverdi A., Aldowaisan T., and Sotskov Y.N. Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times. International Journal of Mathematics and Mathematical Sciences 39 (2003) 2475-2486
3. Allahverdi A., Gupta J.N.D., and Aldowiasan T. A review of scheduling research involving setup considerations. OMEGA The International Journal of Management Sciences 27 (1999) 219-239
4. Allahverdi A., and Sotskov Y.N. Two-machine flowshop minimum length scheduling problem with random and bounded processing times. International Transactions in Operational Research 10 (2003) 65-76
5. Angelelli E., Speranza M.G., and Tuza Z. Semi-on-line scheduling on two parallel processors with an upper bound on the items. Algorithmica 37 (2003) 243-262
6. Bagga P.C., and Khurana K. Two-machine flowshop with separated sequence-independent setup times: mean completion time criterion. Indian Journal of Management and Systems 2 (1986) 47-57
7. Gonzalez T., and Sahni S. Flow shop and job shop schedules. Operations Research 26 (1978) 36-52
8. He Y., and Jiang Y. Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines. Acta Informatica 40 (2004) 367-383
9. He Y., and Zhang G. Semi on-line scheduling on two identical machines. Computing 62 (1999) 179-187
10. Lai T.C., and Sotskov Y.N. Sequencing with uncertain numerical data for makespan minimization. Journal of the Operational Research Society 50 (1999) 230-243
11. Lai T.C., Sotskov Y.N., Sotskova N.Y., and Werner F. Optimal makespan scheduling with given bounds of processing times. Mathematical and Computer Modelling 26 (1997) 67-86
12. Logendran R., Carson S., and Hanson E. Group scheduling in flexible flow shops. International Journal of Production Economics 96 (2005) 143-155
13. Sotskov Y.N., Allahverdi A., and Lai T.C. Flowshop scheduling problem to minimize total completion time with random and bounded processing times. Journal of Operational Research Society 55 (2004) 277-286
14. Tang, L., Huang, L., 2005. Optimal and near-optimal algorithms to rolling batch scheduling for seamless steel tube production. International Journal of Production Economics, in press, doi:10.1016/j.ijpe.2004.04.011.
15. Yoshida T., and Hitomi K. Optimal two-stage production scheduling with set-up times separated. AIIE Transactions 11 (1979) 261-263