A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
DOI10.1016/S0166-218X(96)00106-0zbMATH Open0879.68011OpenAlexW2040466446MaRDI QIDQ1364482FDOQ1364482
Authors: Vadim G. Timkovsky 
Publication date: 4 September 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Recommendations
- scientific article; zbMATH DE number 3970499
- Job shop scheduling with unit time operations under resource constraints and release dates
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Searching and sorting (68P10)
Cites Work
- Title not available (Why is that?)
- Computational Complexity of Discrete Optimization Problems
- Title not available (Why is that?)
- On general routing problems
- An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
- Total completion time minimization in two-machine job shops with unit-time operations
- Minimizing maximum lateness in a two-machine unit-time job shop
- Title not available (Why is that?)
- An efficient algorithm for a job shop problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (21)
- A polynomial algorithm for lot-size scheduling of two type tasks.
- Title not available (Why is that?)
- Job shop scheduling with unit time operations under resource constraints and release dates
- An efficient algorithm for the job-shop problem with two jobs
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
- A note on ``Scheduling unit-time tasks with integer release times and deadlines
- An efficient algorithm for a job shop problem
- Is a unit-job shop not easier than identical parallel machines?
- Polynomial-time approximation schemes for scheduling problems with time lags
- Title not available (Why is that?)
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Scheduling two chains of unit jobs on one machine: a polyhedral study
- Title not available (Why is that?)
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
- On scheduling cycle shops: Classification, complexity and approximation
- Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length
- Title not available (Why is that?)
This page was built for publication: A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364482)
