TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS

DOI10.1142/S0217595910002909zbMath1203.90075MaRDI QIDQ3069763

Longmin He, Wen-Wei Wang, Mingbao Cheng

Publication date: 19 January 2011

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmschedulingflowshopbatch processoridentical machine

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Book review of: Vincent T'kindt and Jean-Charles Billaut, Multicriteria scheduling. Theory, models and algorithms.
• Batching decisions for assembly production systems
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
• Scheduling with batching: A review
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• The Complexity of Flowshop and Jobshop Scheduling
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• Scheduling batches with simultaneous job processing for two-machine shop problems

This page was built for publication: TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS