Polynomial-time approximation schemes for scheduling problems with time lags
From MaRDI portal
Publication:600835
DOI10.1007/S10951-009-0134-8zbMATH Open1201.90094OpenAlexW1966192374MaRDI QIDQ600835FDOQ600835
Authors: Xiandong Zhang, Steef van de Velde 
Publication date: 3 November 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0134-8
Recommendations
- Algorithms and Computation
- Makespan minimization in job shops: a polynomial time approximation scheme
- Approximation schemes for scheduling on parallel machines
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- PTAS for a two-machine flow-shop scheduling problem with release dates and transportation times delay
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- Optimal two- and three-stage production schedules with set-up time included
- The Complexity of Flowshop and Jobshop Scheduling
- Open Shop Scheduling to Minimize Finish Time
- Title not available (Why is that?)
- Heuristics for a coupled-operation scheduling problem
- Scheduling the Open Shop to Minimize Mean Flow Time
- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
- Algorithms and Computation
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- Open shop scheduling with delays
- Shop Problems With Two Machines and Time Lags
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
- A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
- Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags
- Sequencing \(n\) jobs on two machines with arbitrary time lags
- Two-machine open shop scheduling with special transportation times
- Deterministic Scheduling with Pipelined Processors
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
- Algorithms and Computation
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
Cited In (8)
- Optimal appointment scheduling in continuous time: the lag order approximation method
- Title not available (Why is that?)
- Link scheduling in polynomial time
- A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Two-machine interval shop scheduling with time lags
- Coupled task scheduling with exact delays: literature review and models
- Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks
This page was built for publication: Polynomial-time approximation schemes for scheduling problems with time lags
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600835)
