Preemptive scheduling in a two-stage supply chain to minimize the makespan
From MaRDI portal
Publication:3458814
DOI10.1080/10556788.2014.969262zbMath1335.90040WikidataQ57439534 ScholiaQ57439534MaRDI QIDQ3458814
Panos M. Pardalos, Jun Pei, Wenjuan Fan, Boris I. Goldengorin, Shan-Lin Yang, Xin-Bao Liu
Publication date: 28 December 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2014.969262
90C11: Mixed integer programming
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
Related Items
Cites Work
- Tabu search and lower bounds for a combined production-transportation problem
- A heuristic approach to a single stage assembly problem with transportation allocation
- Single-machine batch scheduling minimizing weighted flow times and delivery costs
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
- Preemptive scheduling with simple linear deterioration on a single machine
- On-line supply chain scheduling problems with preemption
- A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
- Single machine scheduling and due date assignment with positionally dependent processing times
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
- How useful are preemptive schedules?
- The significance of reducing setup times/setup costs
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
- Supply Chain Scheduling: Batching and Delivery
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
