Lagrangian bounds for just-in-time job-shop scheduling
From MaRDI portal
Publication:2456651
DOI10.1016/j.cor.2006.05.009zbMath1278.90142OpenAlexW2019595142MaRDI QIDQ2456651
Philippe Baptiste, Marta Flamini, Francis Sourd
Publication date: 19 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.05.009
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (9)
Temporal linear relaxation in IBM ILOG CP optimizer ⋮ Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation ⋮ Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots ⋮ A time-indexed LP-based approach for min-sum job-shop problems ⋮ Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem ⋮ Solving scheduling problems from high-level models ⋮ The job shop scheduling problem with convex costs ⋮ A meta-heuristic to solve the just-in-time job-shop scheduling problem ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
Cites Work
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- Project scheduling. A research handbook.
- An implementation of Shor's \(r\)-algorithm
- PERT scheduling with convex cost functions.
- A hybrid approach to scheduling with earliness and tardiness costs
- The one-machine problem with earliness and tardiness penalties
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
- Solving Project Scheduling Problems by Minimum Cut Computations
- An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem
This page was built for publication: Lagrangian bounds for just-in-time job-shop scheduling
