Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
From MaRDI portal
Publication:1009206
DOI10.1007/s10732-007-9061-zzbMath1180.90127MaRDI QIDQ1009206
Yeong-Dae Kim, Byung-Jun Joo, Jong-Ho Shin
Publication date: 31 March 2009
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-007-9061-z
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Hybrid flowshop scheduling with machine and resource-dependent processing times, The hybrid flow shop scheduling problem
Cites Work
- Unnamed Item
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Branch and bound algorithm for the flow shop with multiple processors
- A taxonomy of flexible flow line scheduling procedures
- Scheduling a hybrid flowshop with batch production at the last stage
- Efficient scheduling algorithms for a single batch processing machine
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Scheduling with agreeable release times and due dates on a batch processing machine
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- A heuristic for the single machine tardiness problem
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Minimizing makespan in hybrid flowshops
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
- Two-stage flowshop scheduling with a common second-stage machine
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- A review: The arrangement increasing partial ordering
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
- An integrated inventory model for a single product and its raw materials
- Two-Stage, Hybrid Flowshop Scheduling Problem
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- An Application of Bin-Packing to Multiprocessor Scheduling
- `` Strong NP-Completeness Results
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Bottleneck-focused scheduling for a hybrid flowshop
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
