A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times
Sign Up to like & getrecommendations! Published in 2020 at "Annals of Operations Research"
DOI: 10.1007/s10479-019-03138-w
Abstract: This paper addresses the unrelated parallel machine scheduling problem with setup times, with an objective of minimizing the makespan. The machines are unrelated in the sense that the processing speed depends on the job being… read more here.
Keywords: worm optimization; dependent setup; setup times; unrelated parallel ... See more keywords
Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times
Sign Up to like & getrecommendations! Published in 2018 at "Journal of the Brazilian Society of Mechanical Sciences and Engineering"
DOI: 10.1007/s40430-018-0980-4
Abstract: We investigate a new variant of the hybrid flow shop problem (HFSP) considering machine blocking and both sequence-independent and sequence-dependent setup times. Since the HFSP is NP-hard, we propose heuristic algorithms along with priority rules… read more here.
Keywords: setup times; hybrid flow; heuristic algorithms; machine blocking ... See more keywords
Dynamic scheduling in make-to-stock production systems with setup times and random breakdowns: performance analysis and improved policies
Sign Up to like & getrecommendations! Published in 2021 at "International Journal of Production Research"
DOI: 10.1080/00207543.2021.1917013
Abstract: We study the scheduling of production in a multi-item, failure-prone machine with setup times, with the objective of minimising long-run average inventory and backlog costs. We make two contributio... read more here.
Keywords: setup times; production; stock production; make stock ... See more keywords
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
A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times
Sign Up to like & getrecommendations! Published in 2017 at "Cogent Engineering"
DOI: 10.1080/23311916.2017.1389638
Abstract: Abstract This work addresses the minimization of the makespan criterion for the permutation flow shop problem with blocking, sequence and machine dependent setup times, which is a problem that has not been studied in previous… read more here.
Keywords: setup times; flow shop; time; permutation flow ... See more keywords
A multi-objective flexible job-shop cell scheduling problem with sequence-dependent family setup times and intercellular transportation by improved NSGA-II
Sign Up to like & getrecommendations! Published in 2021 at "Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture"
DOI: 10.1177/09544054211044660
Abstract: With the development of Industry 4.0 and requirement of smart factory, cellular manufacturing system (CMS) has been widely concerned in recent years, which may leads to reducing production cost and wip inventory due to its… read more here.
Keywords: setup times; objective flexible; multi objective; intercellular transportation ... See more keywords