Optimal job insertion in the no-wait job shop

DOI10.1007/S10878-012-9466-YzbMATH Open1297.90189OpenAlexW2053879808MaRDI QIDQ2392741FDOQ2392741

Authors: 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

Recommendations

• The no-wait job shop with regular objective: a method based on optimal job insertion
• Approximative procedures for no-wait job shop scheduling.
• Minimizing Makespan in No-Wait Job Shops
• Feasible job insertions in the multi-processor-task job shop
• On the application of insertion techniques for job shop problems with setup times
• Optimal job scheduling for flowshops
• Inapproximability results for no-wait job shop scheduling.
• Optimal configurations of general job shops
• No-wait job shop scheduling: tabu search and complexity of subproblems

zbMATH Keywords

stable setscomparability graphno-wait job shopoptimal job insertion

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• The blocking job shop with rail-bound transportation
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
• Feasible insertions in job shop scheduling, short cycles and stable sets
• The no-wait job shop with regular objective: a method based on optimal job insertion
• Coupled task scheduling with exact delays: literature review and models
• Feasible job insertions in the multi-processor-task job shop
• Complexity of the job insertion problem in multi-stage scheduling
• A survey of scheduling problems with no-wait in process

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

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