The no-wait job shop with regular objective: a method based on optimal job insertion

DOI10.1007/S10878-016-0020-1MaRDI QIDQ2359802zbMATH OpenOpenAlexFDO

Authors Reinhard Bürgy, Heinz Groeflin

Publication date 22 June 2017

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-016-0020-1

zbMATH Keywords

local searchfixed time lagsgeneral regular objectiveno-wait job shopoptimal job insertion

Mathematics Subject Classification ID

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

Recommendations

• Optimal job insertion in the no-wait job shop
• A tabu search algorithm for no-wait job shop scheduling problem
• Approximative procedures for no-wait job shop scheduling.
• No-wait job shop scheduling: tabu search and complexity of subproblems
• A neighborhood for complex job shop scheduling problems with regular objectives

Cites work

• A general approach for optimizing regular criteria in the job-shop scheduling problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Complex Scheduling
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• No-wait job shop scheduling: tabu search and complexity of subproblems
• Optimal job insertion in the no-wait job shop
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Scheduling coupled-operation jobs with exact time-lags
• Scheduling. Theory, algorithms, and systems.

Cited in

(3)

• Optimal job insertion in the no-wait job shop
• Coupled task scheduling with exact delays: literature review and models
• The job shop scheduling problem with convex costs

This page was built for publication: The no-wait job shop with regular objective: a method based on optimal job insertion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359802)