A lower bound for the job insertion problem.

DOI10.1016/S0166-218X(02)00502-4zbMath1038.90033MaRDI QIDQ1811122

Tamás Kis, Alain Hertz

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Perfect graphsJob-shop schedulingPolyhedral methods

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Feasible insertions in job shop scheduling, short cycles and stable sets ⋮ Optimal job insertion in the no-wait job shop ⋮ A branch and bound algorithm and iterative reordering strategies for inserting additional trains in real time: a case study in Germany ⋮ Feasible job insertions in the multi-processor-task job shop ⋮ Efficient primal heuristic updates for the blocking job shop problem ⋮ Complexity of the job insertion problem in multi-stage scheduling ⋮ Proactive, dynamic and multi-criteria scheduling of maintenance activities ⋮ Analysis of reactive deadlock-free scheduling in flexible job shops ⋮ The resource-constrained activity insertion problem with minimum and maximum time lags

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of shop-scheduling problems with two or three jobs
• Multi-resource shop scheduling with resource flexibility
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Tabu-search for the multi-mode job-shop problem
• On certain polytopes associated with graphs
• A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
• Insertion techniques for the heuristic solution of the job shop problem
• Effective neighbourhood functions for the flexible job shop problem
• Applying tabu search to the job-shop scheduling problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• Job-shop scheduling using neural networks
• A Fast Taboo Search Algorithm for the Job Shop Problem
• On the application of insertion techniques for job shop problems with setup times
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• Job Shop Scheduling by Local Search

This page was built for publication: A lower bound for the job insertion problem.