Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- 30 October 2007
- journal article
- Published by Springer Nature in Journal of Heuristics
- Vol. 15 (1) , 19-42
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshopInternational Journal of Production Research, 2005
- Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax ProblemJournal of Heuristics, 2004
- Batching in a two-stage flowshop with dedicated machines in the second stageIIE Transactions, 2004
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One StageJournal of the Operational Research Society, 1995
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objectiveComputers & Operations Research, 1994
- Branch and bound algorithm for the flow shop with multiple processorsEuropean Journal of Operational Research, 1991
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel MachinesJournal of the Operational Research Society, 1989
- Tighter Bounds for the Multifit Processor Scheduling AlgorithmSIAM Journal on Computing, 1984
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978