Total completion time minimization in two-machine job shops with unit-time operations

European Journal of Operational Research

Volumn 94, Issue 2, 1996, Pages 310-320

  Kubiak, Wieslaw ^a   Timkovsky, Vadim ^b  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Job shop; Mean flow time; Polynomial algorithm; Unit time operations

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); JUST IN TIME PRODUCTION; OPTIMIZATION; POLYNOMIALS;

MEAN FLOW TIME; POLYNOMIAL ALGORITHMS; TOTAL COMPLETION TIME MINIMIZATION; TWO MACHINE JOB SHOPS; UNIT TIME OPERATIONS;

OPERATIONS RESEARCH;

EID: 0030264824     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(96)00132-4     Document Type: Article

References (8)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. (1976), The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA.
2. Brucker, P. (1982), "A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop, scheduling problems", Lecture Notes in Control and Information Sciences 38, 566-571.
3. Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G., (1979), "Optimization and approximation in deterministic sequencing and scheduling: A survey", Annals of Discrete Mathematics 5, 287-326.
4. Hefetz, N., and Adiri, I. (1982), "An efficient optimal algorithm for the two-machine, unit-time, job-shop, schedule-length", problem, Mathematical Operations Research, 354-360.
5. Kubiak, W. (1989), "A pseudopolynomial algorithm for a two-machine no-wait job shop scheduling problem", European Journal of Operational Research 43, 267-270.
6. Kubiak, W., Sethi, S., and Sriskandarajah, C. (1995), "An efficient algorithm for a job shop problem", Mathematics of Industrial Systems 1, 203-216.
7. Timkovsky, V.G. (1985), "Polynomial-time algorithm for the Lenstra-Rinnooy Kan two-machine scheduling problem" (in Russian), Kibernetika 2, 102-109.
8. Timkovsky, V.G. (1993), "The complexity of unit-time job shop scheduling", Technical Report, Department of Computer Science and Systems, McMaster University, Hamilton, Ont.