A Two-Stage Flexible Flowshop Problem with Deterioration
From MaRDI portal
Publication:3511377
DOI10.1007/978-3-540-69733-6_64zbMath1148.90321OpenAlexW1576703073MaRDI QIDQ3511377
Publication date: 10 July 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_64
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- A concise survey of scheduling with time-dependent processing times
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed