Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
From MaRDI portal
Publication:2257290
DOI10.1016/j.tcs.2015.01.014zbMath1306.90057OpenAlexW2007993141MaRDI QIDQ2257290
Long Wan, Ling-Fa Lu, Li-Qi Zhang
Publication date: 24 February 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.014
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Online integrated production-distribution scheduling problems without preemption, Integrated scheduling problem on a single bounded batch machine with an unavailability constraint, Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery
Cites Work
- Unnamed Item
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- Integrated scheduling of production and delivery on a single machine with availability constraint
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- On-line supply chain scheduling problems with preemption
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- Scheduling with families of jobs and delivery coordination under job availability
- Heuristics for parallel machine scheduling with delivery times
- Parallel machine scheduling with splitting jobs
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- Fast algorithms for bin packing
- Machine scheduling with job delivery coordination
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
- Supply Chain Scheduling: Batching and Delivery
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Scheduling Groups of Jobs on a Single Machine
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Machine scheduling with transportation considerations
