Scheduling with families of jobs and delivery coordination under job availability
From MaRDI portal
Publication:1034606
DOI10.1016/J.TCS.2009.06.025zbMath1194.68088OpenAlexW1975518721MaRDI QIDQ1034606
Publication date: 6 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.025
Related Items (2)
Scheduling two job families on a single machine with two competitive agents ⋮ Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
Cites Work
- Unnamed Item
- Machine scheduling with deliveries to multiple customer locations
- On the machine scheduling problem with job delivery coordination
- A simulated annealing algorithm for single machine scheduling problems with family setups
- Efficient scheduling algorithms for a single batch processing machine
- Coordinated supply chain management
- Minimizing maximum lateness with job families
- Integrated production/distribution planning in supply chains: An invited review
- Machine scheduling with job delivery coordination
- Scheduling with batching: A review
- A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
- A survey of scheduling problems with setup times or costs
- Logistics scheduling with batching and transportation
- Supply Chain Scheduling: Batching and Delivery
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- Scheduling Groups of Jobs on a Single Machine
- Machine scheduling with transportation considerations
This page was built for publication: Scheduling with families of jobs and delivery coordination under job availability
