Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates

Choi, Hyun-Seon; Kim, HyungWon; Lee, Dong‐Ho; Yoon, Junggee; Yun, Chul Yong; Chae, Kevin B.

doi:10.1007/s00170-008-1656-5

Cited by 37 publications

(19 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chen (2006) presented a branch and bound policy for minimising the makespan. Choi et al (2009) developed two types of policy to solve the scheduling problem: (a) a branch and bound policy that gives optimal semi-permutation schedules; and (b) some heuristic policies that give non-permutation schedules, and the experiment showed that one of the heuristics is competitive to the branch and bound policy with respect to the solution quality while requiring much shorter computation times. For solving the problem of increasing the utilisation of a production line, Dugardin et al (2010) adopted Lorenz-non-dominated sorting genetic policy to deal with the problem of increasing the utilisation of machines.…”

Section: Literature Reviewmentioning

confidence: 99%

A two-layer dynamic scheduling method for minimising the earliness and tardiness of a re-entrant production line

Yan

Wang

2012

International Journal of Production Research

View full text Add to dashboard Cite

This study focuses on the dynamic scheduling problem of a re-entrant production line, in which all of the parts are assumed to have the same processing routes and be processed on every machine. A two-layer dynamic scheduling method is proposed for the dynamic scheduling of the re-entrant line with the objective of minimising total earliness and tardiness. This method consists of two layers. The top layer is to select the appropriate scheduling policy, and the bottom layer is to generate the scheduling by using the policy selected in the top layer. In the top layer, three different rules are constructed for selecting scheduling policies, namely the lateness comparison rule, the lateness variation comparison rule, and the equal interval switching rule. In the bottom layer, three different scheduling policies are proposed to generate the real-time scheduling for manufacturing, namely the FCFS (first come first service) scheduling policy, the PI (proportional-integral) scheduling policy, and the fuzzy PI scheduling policy. Considering that the real-time status of manufacturing changes constantly, it is necessary to switch among different scheduling policies to adapt to this change. Numerical experiments are performed in the situations with and without urgent jobs. The results show that the proposed two-layer dynamic scheduling method outperforms any single scheduling policy (e.g., the FCFS policy, the PI policy and the fuzzy PI policy) for the dynamic scheduling of a re-entrant production line.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A two-layer dynamic scheduling method for minimising the earliness and tardiness of a re-entrant production line

Yan

Wang

2012

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…They used a numerical algorithm called power series algorithm, they obtained policies for systems with eight queues. Choi et al [9] presented a scheduling algorithms for two-stage re-entrant hybrid flow shops for minimizing makespan under the maximum allowable due dates. Chen et al [7] studied the reentrant (RFS) flow shop problem using hybrid tabu search to minimize the makespan.…”

Section: Context In Reentrant Schedulingmentioning

confidence: 99%

Fuzzy Project Scheduling

Yalaoui

Dugardin

Yalaoui

et al. 2010

Production Engineering and Management Under Fuzziness

View full text Add to dashboard Cite

“…Hybrid flow shop (HFS) is an extension of flow shop which exists extensively in the real world such as electrical manufacturing (Choi [11]), iron industry (Atighehchian [12]), textile industry (Montoya-Torres [13]) and ports operation (Chen [1,7]; Zeng [8]). For the standard HFS, Ruiz [14] defined it as follows:…”

Section: Description Of Integrated Scheduling Problemmentioning

confidence: 99%

The Integrated Scheduling Problem in Container Terminal with Dual-Cycle Operation

Zhang¹,

Rong²,

Liu³

2014

Int. j. simul. model.

View full text Add to dashboard Cite

The paper proposes an integrated scheduling problem for dual-cycle operation in container terminal, which can be described as a 3-stage hybrid flow shop problem with multi-job families and no-buffer. The integrated scheduling problem is formulated as a mixed-integer programming model. Due to the computational intractability, a simulation-based heuristic algorithm is developed for problem solution. State transition of yard truck, inventory and quota of quay crane and yard crane are introduced into the heuristic algorithm. Computational experiments and simulation analysis are conducted to evaluate the effectiveness of the proposed heuristic algorithm. The results show that the algorithm presented is very effective for the equipment scheduling of meta-container terminal with dual-cycle operation.

show abstract

Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates

Cited by 37 publications

References 30 publications

A two-layer dynamic scheduling method for minimising the earliness and tardiness of a re-entrant production line

A two-layer dynamic scheduling method for minimising the earliness and tardiness of a re-entrant production line

Fuzzy Project Scheduling

The Integrated Scheduling Problem in Container Terminal with Dual-Cycle Operation

Contact Info

Product

Resources

About