A new heuristic for open shop total completion time problem

Applied Mathematical Modelling

Volumn 34, Issue 3, 2010, Pages 735-743

  Tang, Lixin ^a   Bai, Danyu ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

Asymptotical analysis; Open shop problem; Total completion time

Indexed keywords

ASYMPTOTICAL ANALYSIS; ASYMPTOTICALLY OPTIMAL; COMPLETION TIME; MATRIX; NUMERICAL EXPERIMENTATIONS; OPEN SHOP; OPEN SHOP PROBLEM; POSITIVE INTEGERS; SHORTEST PROCESSING TIME; TOTAL COMPLETION TIME;

HEURISTIC METHODS; PORTALS;

HEURISTIC ALGORITHMS;

EID: 70350401130     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2009.06.014     Document Type: Article

References (8)

1. Pinedo M. Scheduling: Theory, Algorithms and Systems. second ed. (2002), Prentice-Hall, New Jersey
2. Brucker P. Scheduling Algorithms. fourth ed. (2004), Springer-Verlag, Berlin
3. Achugbue J.O., and Chin F.Y. Scheduling the open shop to minimize mean flow time. SIAM J. Comput. 11 (1982) 709-720
4. Brucker P., Jurisch B., and Jurisch M. Open shop problems with unit time operations. Math. Meth. Oper. Res. 37 (1993) 59-73
5. Lann A., Mosheiov G., and Rinott Y. Asymptotic optimality in probability of a heuristic schedule for open shop with job overlaps. Oper. Res. Lett. 22 (1998) 63-68
6. Liaw C.-F., Cheng C.-Y., and Chen M. The total completion time open shop scheduling problem with a given sequence of jobs on one machine. Comput. Oper. Res. 29 (2002) 1251-1266
7. Bräsel H., Herms A., Mörig M., Tautenhahn T., Tusch J., and Werner F. Heuristic constructive algorithms for open shop scheduling to minimize mean flow time. Eur. J. Oper. Res. 189 (2008) 856-870
8. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic machine sequencing and scheduling: a survey. Ann. Discrete Math. 5 (1979) 287-326