A note on weighted completion time minimization in a flexible flow shop

DOI10.1016/S0167-6377(01)00072-4zbMath0981.90025MaRDI QIDQ5949902

Kyparisis, George J., Christos P. Koulamas

Publication date: 5 December 2001

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

schedulingparallel machinesworst-case analysisflexible flow shopapproximation/heuristic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem ⋮ Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises ⋮ The hybrid flow shop scheduling problem ⋮ Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Some results of the worst-case analysis for flow shop scheduling
• Scheduling with Deadlines and Loss Functions
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
• Scheduling independent tasks to reduce mean finishing time

This page was built for publication: A note on weighted completion time minimization in a flexible flow shop