Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times u
- PDF / 450,504 Bytes
- 15 Pages / 439.37 x 666.142 pts Page_size
- 95 Downloads / 224 Views
Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines Shaojun Lu1,3 · Xinbao Liu1,3 · Jun Pei1,2 · Panos M. Pardalos2 Received: 24 February 2018 / Accepted: 24 August 2018 © Springer-Verlag GmbH Germany, part of Springer Nature 2018
Abstract This paper investigates permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines. In the proposed models, we need to make joint decisions on part families sequencing and jobs sequencing within each family. To solve the makespan minimization problem, the structural properties of the optimal solutions are derived, based on which an optimization algorithm is developed. Then, we consider the total completion time minimization problem and propose a useful lemma for the optimal solutions. Finally, we discuss two special cases of the problem and propose optimization algorithms to solve them respectively. Keywords Scheduling · Flowshop · Part family · Deteriorating jobs · Sequence dependent setup times · Dominant machines
1 Introduction In most traditional scheduling models, the job processing time is assumed to be constant during the production process. However, this assumption is usually not
B B B
Shaojun Lu [email protected] Xinbao Liu [email protected] Jun Pei [email protected]
1
School of Management, Hefei University of Technology, Hefei, China
2
Department of Industrial and Systems Engineering, Center for Applied Optimization, University of Florida, Gainesville, USA
3
Key Laboratory of Process Optimization and Intelligent Decision-Making of Ministry of Education, Hefei, China
123
S. Lu et al.
appropriate in real production, e.g., emergency treatment, maintaining machines, firefighting, or cleaning assignments. The actual processing time of a job may increase over time, which is known as deteriorating effect in the literature. Extensive surveys of scheduling problems considering deteriorating effect and corresponding solution procedures can be found in Cheng et al. [3] and Oron [18]. In recent years, a considerable literature has grown up around the theme of deteriorating jobs scheduling problems including Yin et al. [32], Tang et al. [26], and Wang and Li [27]. For the classical work on the flowshop scheduling, abundant research results were presented in Nowicki and Smutnicki [17] and Osman and Potts [19]. Ho and Gupta [8] and Kampmeyer et al. [9] considered flowshop scheduling problems under dominant machines. However, deteriorating effect is ubiquitous and can not be ignored in practical flowshop scheduling problems. Wang et al. [30] and Cheng et al. [1] considered more complex flowshop scheduling problems with deteriorating jobs and developed branch-and-bound algorithms. More recent papers that investigated flowshop scheduling problems with deteriorating jobs include Lin and Cheng [12], Wang et al. [29], Lee et al. [11], Sun et al. [25], Wang and Wang [28], Cheng et al. [2], Lu [
Data Loading...
