An efficient algorithm for a job shop problem

DOI10.1007/BF02099698MaRDI QIDQ1897385zbMATH OpenOpenAlexFDO

Authors Suresh P. Sethi, Wieslaw Kubiak, Chelliah Sriskandarajah

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)

Recommendations

• Total completion time minimization in two-machine job shops with unit-time operations
• An efficient algorithm for the job-shop problem with two jobs
• Efficient algorithms for flexible job shop scheduling with parallel machines
• A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
• An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
• Computational Complexity of Discrete Optimization Problems
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling unit-time tasks with integer release times and deadlines
• Some no-wait shops scheduling problems: Complexity aspect
• The Complexity of Flowshop and Jobshop Scheduling

Cited in

(12)

• An efficient algorithm for the job-shop problem with two jobs
• scientific article; zbMATH DE number 2186533 (Why is no real title available?)
• Efficient algorithms for flexible job shop scheduling with parallel machines
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
• Total completion time minimization in two-machine job shops with unit-time operations
• Shop scheduling problems with multiprocessor tasks on dedicated processors
• Is a unit-job shop not easier than identical parallel machines?
• A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
• scientific article; zbMATH DE number 4099024 (Why is no real title available?)
• Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• Job-shop scheduling with blocking and no-wait constraints

This page was built for publication: An efficient algorithm for a job shop problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897385)