A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines
From MaRDI portal
Publication:2456642
DOI10.1016/j.cor.2006.04.004zbMath1278.90165MaRDI QIDQ2456642
Chou-Jung Hsu, Chwen-Tzeng Su, Chinyao Low
Publication date: 19 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.04.004
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines, The hybrid flow shop scheduling problem, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
Cites Work
- Unnamed Item
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- A two-stage hybrid flowshop with uniform machines and setup times
- A multi-stage parallel-processor flowshop problem with minimum flowtime
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
- Heuristic algorithms for the two-stage hybrid flowshop problem
- Two-stage flowshop scheduling with a common second-stage machine
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- Two-Stage, Hybrid Flowshop Scheduling Problem
- A computational study of heuristics for two-stage flexible flowshops
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
