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

DOI10.1016/0377-2217(96)00132-4zbMath0953.90523OpenAlexW2089564682MaRDI QIDQ1278312

Wiesław X. Kubiak, Timkovsky, Vadim G.

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(96)00132-4

zbMATH Keywords

job shoppolynomial algorithmmean flow timeunit time operations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Using mixed graph coloring to minimize total completion time in job shop scheduling, A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem, Is a unit-job shop not easier than identical parallel machines?, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem, Deterministic job-shop scheduling: Past, present and future, On scheduling cycle shops: Classification, complexity and approximation

Cites Work

• Unnamed Item
• Unnamed Item
• A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
• An efficient algorithm for a job shop problem
• An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey