Minimizing total tardiness on a two-machine re-entrant flowshop
type: Item
instance of: scholarly article
title: Minimizing total tardiness on a two-machine re-entrant flowshop
zbMATH Open document ID: 1176.90653
author: Seong-Woo Choi
author: Yeong-Dae Kim
published in: European Journal of Operational Research
publication date: 2009-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5642879
zbMATH Keywords: scheduling
zbMATH Keywords: re-entrant flowshop
zbMATH Keywords: branch and bound
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.11.037
OpenAlex ID: W1972299589
cites work: Minimizing makespan on a two-machine re-entrant flowshop
cites work: Minimizing makespan on an \(m\)-machine re-entrant flowshop
cites work: Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
cites work: Decomposition methods for reentrant flow shops with sequence-dependent setup times
cites work: A heuristic algorithm for two-machine re-entrant shop scheduling
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
cites work: Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
cites work: Minimizing total tardiness in permutation flowshops
cites work: The Total Tardiness Problem: Review and Extensions
cites work: Mean Flow Time Minimization in Reentrant Job Shops with a Hub
cites work: Focused Scheduling in Proportionate Flowshops
cites work: Minimizing tardiness in a two-machine flow-shop
cites work: Minimizing makespan in re-entrant permutation flow-shops
cites work: Mixed binary integer programming formulations for the reentrant job shop scheduling problem
cites work: Two-machine flowshop scheduling to minimize total tardiness
cites work: Note on minimizing total tardiness in a two-machine flowshop
cites work: The two-machine flowshop scheduling problem with total tardiness
cites work: Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
cites work: Minimizing Makespan in a Class of Reentrant Shops
cites work: Multi-family scheduling in a two-machine reentrant flow shop with setups
DOI: 10.1016/J.EJOR.2008.11.037
description: scientific article; zbMATH DE number 5642879