An efficient algorithm for a job shop problem
From MaRDI portal
Publication:1897385
DOI10.1007/BF02099698zbMATH Open0838.90064OpenAlexW3122988155MaRDI QIDQ1897385FDOQ1897385
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
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
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling unit-time tasks with integer release times and deadlines
- The Complexity of Flowshop and Jobshop Scheduling
- Computational Complexity of Discrete Optimization Problems
- Some no-wait shops scheduling problems: Complexity aspect
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
- Flowshop and Jobshop Schedules: Complexity and Approximation
- An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
Cited In (12)
- An efficient algorithm for the job-shop problem with two jobs
- Efficient algorithms for flexible job shop scheduling with parallel machines
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
