Single machine batch scheduling with release times and delivery costs
From MaRDI portal
Publication:398839
DOI10.1007/s10951-011-0255-8zbMath1297.90057OpenAlexW2069541979MaRDI QIDQ398839
Esaignani Selvarajah, George Steiner, Rui Zhang
Publication date: 18 August 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-011-0255-8
Related Items
Integrated production and outbound distribution scheduling problems with job release dates and deadlines ⋮ An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain ⋮ Scheduling in a two-stage supply chain with uncertain parameters ⋮ Scheduling and common due date assignment on a single parallel-batching machine with batch delivery ⋮ Supply chain scheduling to minimize holding costs with outsourcing ⋮ Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single machine batch scheduling with release times
- Batch sizing and job sequencing on a single machine
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Efficient heuristics to minimize total flow time with release dates
- The complexity of one-machine batching problems
- A 1. 47-approximation for a preemptive single-machine scheduling problem
- Scheduling with batching: A review
- A survey of scheduling problems with setup times or costs
- Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems
- Approximation Techniques for Average Completion Time Scheduling
- Supply Chain Scheduling: Batching and Delivery
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
This page was built for publication: Single machine batch scheduling with release times and delivery costs