SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
From MaRDI portal
Publication:3526523
DOI10.1142/S0217595908001778zbMath1163.90516MaRDI QIDQ3526523
Jinjiang Yuan, Lei Shi, Jinwen Ou
Publication date: 25 September 2008
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Related Items (7)
A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization ⋮ Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval ⋮ Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown ⋮ Integrated scheduling of production and delivery on a single machine with availability constraint ⋮ Order acceptance and scheduling with machine availability constraints ⋮ Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Single machine flow-time scheduling with a single breakdown
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Approximability of scheduling with fixed jobs
- Scheduling with limited machine availability
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Machine scheduling with an availability constraint
- Scheduling the maintenance on a single machine
- Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
- Single machine scheduling with a restricted rate-modifying activity
- Single-machine scheduling with maintenance and repair rate-modifying activities
This page was built for publication: SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
