A lower bound for the job insertion problem.
From MaRDI portal
Publication:1811122
DOI10.1016/S0166-218X(02)00502-4zbMath1038.90033MaRDI QIDQ1811122
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
Related Items
Feasible insertions in job shop scheduling, short cycles and stable sets, Feasible job insertions in the multi-processor-task job shop, Complexity of the job insertion problem in multi-stage scheduling
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
