Preemptive scheduling in a two-stage supply chain to minimize the makespan

DOI10.1080/10556788.2014.969262zbMath1335.90040OpenAlexW1979637415WikidataQ57439534 ScholiaQ57439534MaRDI QIDQ3458814

Wenjuan Fan, Jun Pei, Xin-Bao Liu, Boris I. Goldengorin, Panos M. Pardalos, Shan-Lin Yang

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

zbMATH Keywords

transportationsupply chainrelease timepreemptionbatch schedulingset-up time

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling ⋮ Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities

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

This page was built for publication: Preemptive scheduling in a two-stage supply chain to minimize the makespan