Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem

DOI10.1155/2014/431325zbMath1407.90179OpenAlexW2139755548WikidataQ59067154 ScholiaQ59067154MaRDI QIDQ1718383

Yan Li, Sunxin Wang

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/431325

Mathematics Subject Classification ID

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

Related Items (2)

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

• Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
• Lagrangian bounds for just-in-time job-shop scheduling
• Dynamic job shop scheduling using variable neighbourhood search
• Sequencing with Earliness and Tardiness Penalties: A Review
• Variable neighborhood search: Principles and applications

This page was built for publication: Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem