Optimal job insertion in the no-wait job shop

DOI10.1007/s10878-012-9466-yzbMath1297.90189OpenAlexW2053879808MaRDI QIDQ2392741

Reinhard Bürgy, Heinz Groeflin

Publication date: 2 August 2013

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

Full work available at URL: https://doi.org/10.1007/s10878-012-9466-y

zbMATH Keywords

comparability graphstable setsno-wait job shopoptimal job insertion

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

The no-wait job shop with regular objective: a method based on optimal job insertion ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ A survey of scheduling problems with no-wait in process ⋮ Coupled task scheduling with exact delays: literature review and models ⋮ The blocking job shop with rail-bound transportation

Cites Work

• Feasible insertions in job shop scheduling, short cycles and stable sets
• A new neighborhood and tabu search for the blocking job shop
• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
• Insertion techniques for the heuristic solution of the job shop problem
• A lower bound for the job insertion problem.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• No-wait job shop scheduling: tabu search and complexity of subproblems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling

This page was built for publication: Optimal job insertion in the no-wait job shop