An efficient algorithm for a job shop problem

DOI10.1007/BF02099698zbMath0838.90064OpenAlexW3122988155MaRDI QIDQ1897385

Suresh P. Sethi, Chelliah Skriskandarajah, Wiesław X. Kubiak

Publication date: 27 August 1995

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02099698

zbMATH Keywords

makespantwo-machine job shopunit processing time operations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Shop scheduling problems with multiprocessor tasks on dedicated processors, 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?, Efficient algorithms for flexible job shop scheduling with 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, Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems, Total completion time minimization in two-machine job shops with unit-time operations, Job-shop scheduling with blocking and no-wait constraints

Cites Work

• Unnamed Item
• A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
• Some no-wait shops scheduling problems: Complexity aspect
• Scheduling unit-time tasks with integer release times and deadlines
• Optimal two- and three-stage production schedules with setup times included
• An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Complexity of Flowshop and Jobshop Scheduling
• Computational Complexity of Discrete Optimization Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey