A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time
From MaRDI portal
Publication:3055211
DOI10.1080/00207540701824217zbMATH Open1198.90188OpenAlexW2157536916MaRDI QIDQ3055211FDOQ3055211
Authors: In-Jae Jeong, Seung-Bin Yim 
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
Recommendations
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- Minimizing the total completion time in a distributed two stage assembly system with setup times
- Study of job shop scheduling problem
- The distributed permutation flowshop scheduling problem
- Survey on optimization algorithms for distributed shop scheduling
Cites Work
- Title not available (Why is that?)
- Scheduling Problems with Two Competing Agents
- The Complexity of Flowshop and Jobshop Scheduling
- Supply chain management and advanced planning -- basics, overview and challenges
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach
- Dynamic single-machine scheduling under distributed decision-making
Cited In (4)
- Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review
- Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation
- Lagrangian relaxation of the generic materials and operations planning model
- Lagrangian bounds for just-in-time job-shop scheduling
This page was built for publication: A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055211)
