Two-machine flowshop scheduling with conditional deteriorating second operations

International Transactions in Operational Research

Volumn 13, Issue 2, 2006, Pages 91-98

  Lin, B M T ^a   Cheng, T C E ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Flowshop scheduling; Makespan; N P hardness; Waiting time

Indexed keywords

EID: 85007084598     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2006.00536.x     Document Type: Article

References (11)

1. Cheng, T.C.E., Ding, Q., Lin, B.M.T., 2003. A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research 152, 1-13.
2. Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.
3. Gilmore, P.C., Gomory, R.E., 1964. Sequencing a one-state variable machine: a solvable case of the traveling salesman problem. Operations Research 12, 655-679.
4. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287-326.
5. Hall, N., Sriskandarajah, C., 1996. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44, 510-525.
6. Johnson, S.M., 1954. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1, 61-68.
7. Johnson, S.M., 1959. Discussions: sequencing n jobs on two machines with arbitrary time lags. Management Science 5, 299-303.
8. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., 1993. Sequencing and scheduling: algorithms and complexity. InGraves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H.(eds) Logistics of Production and Inventory. North Holland, Amsterdam, the Netherlands, pp.445-522.
9. Mitten, L.G., 1958. Sequencing n jobs on two machines with arbitrary time lags. Management Science 5, 293-298.
10. Mitten, L.G., 1959. A scheduling problem: an analytical solution based upon two machines, n jobs, arbitrary start and stop lags, and common sequences. Journal of Industrial Engineering 10, 131-135.
11. Reisman, A., Kumar, A., Motwani, J., 1997. Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994. IEEE Transactions on Engineering Management 44, 316-329.