Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
From MaRDI portal
Publication:1415102
DOI10.1155/S016117120321019XzbMath1041.90020OpenAlexW2100147010MaRDI QIDQ1415102
Ali Allahverdi, Yuri N. Sotskov, Tariq A. Aldowaisan
Publication date: 3 December 2003
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/50840
Related Items
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times, Schedule execution for two-machine flow-shop with interval processing times, Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times, Minimizing total weighted completion time with uncertain data: a stability approach, Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times, Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times, Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness, Uncertainty measure for the Bellman-Johnson problem with interval processing times, A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure, A survey of scheduling problems with setup times or costs, Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times, Minimizing total weighted flow time of a set of jobs with interval processing times, Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times, The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times, Johnson's problem with stochastic processing times and optimal service level
