Paper Info
Title
Scheduling to minimize the makespan in large-piece one-of-a-kind production with machine availability constraints
Abstract
Focus on scheduling of an LP-OKP model with machines availability constraints.Propose slack-based mixed integer linear programming scheduling algorithm.Propose slot-based search scheduling algorithm.Evaluate the proposed algorithms through a real case of power plant building industry. This paper addresses a job shop scheduling problem, in which the jobs belong to the large-piece one-of-a-kind production (LP-OKP) model, and the machines are subject to availability constraints (Jm(LP-OKP), hjk |r-a |Cmax). The objective is considered to minimize the makespan. The scheduling model is derived from real industries, such as ship building industry, power plant building industry, steel-structure building industry and so on, and represents a more realistic and complex situation. In this study, two different scheduling algorithms of a slack-based mixed integer linear programming (MILP) model and a time slot-based search method are proposed to solve the scheduling problem. The experiments are implemented on CPLEX and search scheduling platform, respectively. The results reveal that the slack-based MILP model and time slot-based search method give better solutions than the rule-based algorithm. The deviation of objective optimal value results show that the slack-based MILP model and time slot-based search method can improve the makespan solution by 0.7% and 5.6%, respectively. And the percentage improvement of CPU time results show that they can shorten the CPU time by 74.5% and 12.9%, respectively. We found that the performance of the time slot-based search method is significantly competitive as compared to the slack-based MILP model but its CPU time is significantly higher than that of the slack-based MILP model.
Year
DOI
Venue
2015
10.1016/j.eswa.2015.08.012
Expert Systems with Applications
Keywords
Field
DocType
Large-piece one-of-a-kind production,Availability constraints,Slack-based mixed integer linear programming model,Time slot-based search method
Mathematical optimization,Job shop scheduling,Fair-share scheduling,Scheduling (computing),CPU time,Computer science,Least slack time scheduling,Integer programming,Rate-monotonic scheduling,Dynamic priority scheduling
Journal
Volume
Issue
ISSN
42
23
0957-4174
Citations 
PageRank 
References 
0
0.34
15
Authors
3
Name
Order
Citations
PageRank
Wenyou Jia182.71
Z. B. Jiang224236.08
You Li354.64