Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
From MaRDI portal
Publication:2342682
DOI10.1016/j.tcs.2015.03.046zbMath1310.90042OpenAlexW1991992062MaRDI QIDQ2342682
Youjun Chen, Jinjiang Yuan, Ling-Fa Lu
Publication date: 29 April 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.03.046
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (4)
Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing ⋮ Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
- A note on the complexity of flow shop scheduling with transportation constraints
- Improved algorithms for two single machine scheduling problems
- On the machine scheduling problem with job delivery coordination
- Production scheduling with supply and delivery considerations to minimize the makespan
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Heuristics for parallel machine scheduling with delivery times
- Design and operational issues in AGV-served manufacturing systems
- Machine scheduling with job delivery coordination
- Complexity of flow shop scheduling problems with transportation constraints
- Single machine scheduling with release dates and job delivery to minimize the makespan
- Scheduling with Deadlines and Loss Functions
- Optimal two- and three-stage production schedules with setup times included
- Scheduling of a Two-machine Flowshop with Travel Time Between Machines
- Machine scheduling with an availability constraint and job delivery coordination
- Scheduling Parts in a Combined Production-transportation Work Cell
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- ON EQUIVALENT-JOB FOR JOB-BLOCK IN 2×n SEQUENCING PROBLEM WITH TRANSPORTATION-TIMES
- ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a two-machine flowshop with travel times to minimize maximum lateness
- Machine scheduling with transportation considerations
- Makespan minimization for flow-shop problems with transportation times and a single robot
This page was built for publication: Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
