A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time

DOI10.1080/00207540701824217zbMath1198.90188OpenAlexW2157536916MaRDI QIDQ3055211

Seung-Bin Yim, In-Jae Jeong

Publication date: 7 November 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701824217

zbMATH Keywords

Lagrangian relaxationjob shop schedulingcooperation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation ⋮ Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review ⋮ Lagrangian relaxation of the generic materials and operations planning model

Cites Work

• Unnamed Item
• Supply chain management and advanced planning -- basics, overview and challenges
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• Scheduling Problems with Two Competing Agents
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• The Complexity of Flowshop and Jobshop Scheduling
• Dynamic single-machine scheduling under distributed decision-making
• Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach

This page was built for publication: A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time