Title
Preemptive scheduling in a two-stage supply chain to minimize the makespan
Abstract
This paper deals with the problem of preemptive scheduling in a two-stage supply chain framework. The supply chain environment contains two stages: production and transportation. In the production stage <inline-formula><inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink=\"goms_a_969262_ilm0001.gif\"/</inline-formula> jobs are processed on a manufacturer's bounded serial batching machine, preemptions are allowed, and set-up time is required before a new batch is processed. In the transportation stage each batch is delivered to a customer by a single vehicle. The objective is to minimize the makespan by making decisions for both mutually coordinated stages. Specifically, two versions are studied. The first one is that all jobs are available to be processed at time zero, and the second one is that jobs have different release times. An <inline-formula><inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink=\"goms_a_969262_ilm0002.gif\"/</inline-formula> time algorithm is developed for the first version, and we show that it can produce the optimal schedule for the entire problem. For the second version, based on some useful properties we have designed an <inline-formula><inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink=\"goms_a_969262_ilm0003.gif\"/</inline-formula> time heuristic and a novel lower bound. The worst-case performance ratio of our algorithm is bounded by 2. Our computational study with random instances of different scales shows high-quality solutions for either small-scale or large-scale instances returned in a reasonable PC times.
Year
DOI
Venue
2015
10.1080/10556788.2014.969262
Optimization Methods and Software
Keywords
Field
DocType
supply chain,transportation,batch scheduling,preemption
Preemption,Mathematical optimization,Heuristic,Job shop scheduling,Upper and lower bounds,Performance ratio,Supply chain,Job scheduler,Mathematics,Bounded function
Journal
Volume
Issue
ISSN
30
4
1055-6788
Citations 
PageRank 
References 
2
0.37
16
Authors
6
Name
Order
Citations
PageRank
Jun Pei120226.56
Wenjuan Fan214110.09
P. M. Pardalos326945.19
Xin-Bao Liu425426.14
Boris Goldengorin518217.58
Shanlin Yang678760.80