A heuristic algorithm for two-machine re-entrant shop scheduling
From MaRDI portal
Publication:1290158
DOI10.1023/A:1018927407164zbMath0921.90090MaRDI QIDQ1290158
Inna G. Drobouchevitch, Vitaly A. Strusevich
Publication date: 10 June 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018927407164
90B35: Deterministic scheduling theory in operations research
Related Items
Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop, Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem, Minimizing total completion time for re-entrant flow shop scheduling problems, On the connection between a cyclic job shop and a reentrant flow shop scheduling problem, Heuristic algorithms for two machine re-entrant flow shop, Scheduling reentrant jobs on parallel machines with a remote server, Minimizing total tardiness on a two-machine re-entrant flowshop, On scheduling cycle shops: Classification, complexity and approximation, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Multi-family scheduling in a two-machine reentrant flow shop with setups
