Scheduling hybrid flowshop with parallel batching machines and compatibilities

DOI10.1016/j.cor.2008.06.011zbMath1179.90125OpenAlexW2034451750MaRDI QIDQ1000991

Ammar Oulamara, Adrien Bellanger

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00582858/file/COR.pdf

zbMATH Keywords

batch processing machinestask compatibilitieshybrid flowshop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Hybrid variable neighborhood search for automated warehouse scheduling, No-Wait Scheduling Problems with Batching Machines, A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines, Unnamed Item, The hybrid flow shop scheduling problem, Scheduling an unbounded batching machine with job processing time compatibilities, A survey of scheduling with parallel batch (p-batch) processing, Single-machine batch scheduling with job processing time compatibility, Learning-based multi-objective evolutionary algorithm for batching decision problem

Cites Work

• Flowshop scheduling problem with a batching machine and task compatibilities
• Scheduling a batching machine
• Minimizing makespan in hybrid flowshops
• Heuristic algorithms for the two-stage hybrid flowshop problem
• Heuristics for hybrid flow shops with controllable processing times and assignable due dates
• A PTAS for semiconductor burn-in scheduling
• Minimizing makespan with release times on identical parallel batching machines
• Scheduling with batching: A review
• Batch processing with interval graph compatibilities between tasks
• Scheduling two-stage hybrid flow shop with availability constraints
• Optimal two- and three-stage production schedules with setup times included
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A computational study of heuristics for two-stage flexible flowshops
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling batches with simultaneous job processing for two-machine shop problems
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
• Unnamed Item
• Unnamed Item