Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times
Sign Up to like & getrecommendations! Published in 2022 at "Journal of the Operational Research Society"
DOI: 10.1080/01605682.2022.2039569
Abstract: Abstract We propose four algorithms for the no-wait flow shop scheduling problem. The objective is minimizing total completion time such that makespan is not greater than a maximum value. We address the problem with sequence-dependent… read more here.
Keywords: wait flow; completion time; sequence dependent; setup times ... See more keywords
Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study
Sign Up to like & getrecommendations! Published in 2019 at "Engineering Optimization"
DOI: 10.1080/0305215x.2018.1485903
Abstract: ABSTRACT In this article, the impact of preventive maintenance policies on the constructive heuristics performance for the no-wait flow-shop problem with total flow-time minimization is evaluated. The main constructive heuristics for the m-machine no-wait flow-shop… read more here.
Keywords: flow shop; total flow; wait flow; flow time ... See more keywords
A Population-Based Iterated Greedy Algorithm for Distributed Assembly No-Wait Flow-Shop Scheduling Problem
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Transactions on Industrial Informatics"
DOI: 10.1109/tii.2022.3192881
Abstract: This article investigates a distributed assembly no-wait flow-shop scheduling problem (DANWFSP), which has important applications in manufacturing systems. The objective is to minimize the total flowtime. A mixed-integer linear programming model of DANWFSP with total… read more here.
Keywords: problem; wait flow; algorithm; distributed assembly ... See more keywords