Two-machine flow-shop scheduling to minimize total late work

Engineering Optimization

Volumn 38, Issue 4, 2006, Pages 501-509

  Lin, B M T ^a   Lin, F C ^b   Lee, R C T ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

Branch and bound algorithm; Complexity; Flow shop; Late work

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; OPTIMAL SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING;

BRANCH-AND-BOUND ALGORITHM; COMPLEXITY; FLOW SHOP; LATE WORK; NUMERICAL RESULTS;

PROBLEM SOLVING;

EID: 33646426126     PISSN: 0305215X     EISSN: 10290273     Source Type: Journal    
DOI: 10.1080/03052150500420439     Document Type: Article

References (13)

1. Blazewicz, J., Scheduling preemptible tasks on parallel processors with information loss. Technique Sci. Inf., 1984, 3(6), 415-420.
2. Blazewicz, J. and Finke, G., Minimizing mean weighted execution time loss on identical and uniform processors. Inf. Processing Lett., 1987, 24, 259-263.
3. Blazewicz, J., Pesch, E., Sterna, M. and Werner, F., Open shop scheduling problems with late work criteria. Discrete Appl. Math., 2004, 134, 1-24.
4. Blazewicz, J., Pesch, E., Sterna, M. and Werner, F., The two-machine flow-shop problem with weighted late work criterion and common due date. Eur. J. Operational Res., 2005, 165(2), 408-415.
5. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-completeness, 1979 (Freeman: San Francisco, CA).
6. Graham, R.L., Lawler, E.L., Lenstra, J.K. and Rinnoy Kan, A.H.G., Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math., 1979, 5, 287-326.
7. Hariri, A.M.A., Potts, C.N. and Wassenhove, L.N., Single machine scheduling to minimize total weighted late work. ORSA J. Comput., 1995, 7, 232-242.
8. Johnson, S.M., Optimal two- and three-stage production schedules with setup times included. Nav. Res. Logistics Q., 1954, 1(1), 61-68.
9. Kethley, R.B. and Alidaee, B., Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms. Comput. Ind. Engng., 2002, 43, 509-528.
10. Lin, B.M.T. and Hsu, S.W., Minimizing total late work on a single machine with release and due dates, in 2005 SIAM Conference on Computational Science and Engineering, Orlando, Florida, USA, February 2005.
11. Pinedo, M. and Chao, X., Operations Scheduling with Applications in Manufacturing and Services, 1999 (McGraw-Hill: Singapore).
12. Potts, C.N. and Van Wassenhove, L.N., Single machine scheduling to minimize total late work. Operations Res., 1992a, 40, 586-595.
13. Potts, C.N. and Van Wassenhove, L.N., Approximation algorithms for scheduling a single machine to minimize total late work. Operations Res. Lett., 1992b, 11, 261-266.