Scheduling preemptive open shops to minimize total tardiness

European Journal of Operational Research

Volumn 162, Issue 1, 2005, Pages 173-183

  Liaw, Ching Fang ^a  

^a CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Branch and bound; Open shop; Scheduling; Tardiness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

BRANCH-AND-BOUND; OPEN SHOP; TARDINESS;

OPERATIONS RESEARCH;

EID: 8344270234     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.10.010     Document Type: Conference Paper

References (16)

1. Brucker P. Scheduling Algorithms. 1995;Springer-Verlag, Berlin, Heidelberg.
2. Cho Y., Sahni S. Preemptive scheduling of independent jobs with release and due times on open, flow and job shops. Operations Research. 29:1981;511-522.
3. Du J., Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research. 15:1990;483-495.
4. Fisher M.L. A dual algorithm for the one machine scheduling problem. Mathematical Programming. 11:1976;229-251.
5. Gonzalez T. A note on open shop preemptive schedules. IEEE Transactions on Computers. C-28:1979;782-786.
6. Gonzalez T., Sahni S. Open shop scheduling to minimize finish time. Journal of the Association for Computing Machinery. 23(4):1976;665-679.
7. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics. 5:1979;287-326.
8. Karzanov A.V. Determining the maximal flow in a network by the method of preflows. Soviet Mathematics Doklady. 15:1974;434-437.
9. Kuhn H.W. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly. 1:1955;83-97.
10. Lageweg B.J., Lenstra J.K., Rinnooy Kan A.H.G. A general bounding scheme for the permutation flow-shop problem. Operations Research. 26:1978;53-67.
11. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Minimizing maximum lateness in a two-machine open shop. Mathematics of Operations Research. 6:1981;153-158.
12. Liu C.Y. A branch-and-bound algorithm for the preemptive open shop scheduling problem. Journal of the Chinese Institute of Industrial Engineers. 12(1):1995;25-31.
13. Liu C.Y., Bulfin R.L. Scheduling ordered open shops. Computers and Operations Research. 14(3):1987;257-264.
14. Liu C.Y., Bulfin R.L. On the complexity of preemptive open shop scheduling problem. Operations Research Letters. 4:1985;71-74.
15. Pinedo M. Scheduling: Theory, Algorithms, and Systems. 1995;Prentice Hall, Englewood Cliffs, New Jersey.
16. Schrage L., Baker K.R. Dynamic programming solution of sequencing problems with precedence constraints. Operations Research. 26:1978;444-449.