摘要
This study addresses a job shop scheduling problem in which jobs are grouped into job families, but they are processed individually using their distinct routings. Unlike the previous studies, we consider a due-date-based objective of minimising the total family tardiness, i.e., sum of positive deviations between the due-dates and the completion times of job families. A mixed integer programming model is developed to represent the problem mathematically. Then, an optimal algorithm is proposed using the branch and bound technique while developing a job family-based lower bound. For practical applications up to large sized instances, two types of heuristics, modified shifting bottleneck and priority scheduling algorithms, are also proposed. To test the performances of the three types of solution algorithms, computational experiments were done on a number of test instances and the results are reported.
学科与关键词
- Minimizing the total weighted earliness and tardiness for a sequence of operations in job shopsGirish, Baby Sivanandan*; Habibullah; Dileeplal, JessammaRAIRO-OPERATIONS RESEARCH, 2022, 56(4): 2621-2649.被引 2
- Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-upsKim, Ji-Su; Park, Jung-Hyeon; Lee, Dong-Ho*ENGINEERING OPTIMIZATION, 2017, 49(10): 1719-1732.被引 17
- Minimizing flow time in a flow-line manufacturing cell with family setup timesGupta, JND*; Schaller, JEJournal of the Operational Research Society, 2006, 57(2): 163-176.被引 31
