A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem

DOI10.1016/0377-2217(89)90225-7zbMath0702.90039OpenAlexW1997460775MaRDI QIDQ915632

Wiesław X. Kubiak

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90225-7

zbMATH Keywords

job shopunit processing timestwo machinespseudo-polynomial algorithms

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

An efficient algorithm for a job shop problem ⋮ On a scheduling problem in a robotized analytical system ⋮ Is a unit-job shop not easier than identical parallel machines? ⋮ Efficient algorithms for flexible job shop scheduling with parallel machines ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ Total completion time minimization in two-machine job shops with unit-time operations ⋮ Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some no-wait shops scheduling problems: Complexity aspect
• Minimizing maximum lateness in a two-machine unit-time job shop
• Complexity of Scheduling Shops with No Wait in Process
• An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
• Computational Complexity of Discrete Optimization Problems