Feasible insertions in job shop scheduling, short cycles and stable sets
From MaRDI portal
Publication:856271
DOI10.1016/J.EJOR.2005.12.025zbMATH Open1102.90021OpenAlexW2076441555MaRDI QIDQ856271FDOQ856271
Andreas Klinkert, Heinz Groeflin
Publication date: 7 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.025
Cites Work
- Title not available (Why is that?)
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
- Applying tabu search to the job-shop scheduling problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Multi-resource shop scheduling with resource flexibility
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A heuristic to schedule flexible job-shop in a glass factory
- Effective neighbourhood functions for the flexible job shop problem
- Job Shop Scheduling by Local Search
- Approximative procedures for no-wait job shop scheduling.
- A lower bound for the job insertion problem.
- Job-shop scheduling with blocking and no-wait constraints
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Tabu-search for the multi-mode job-shop problem
- Job-shop scheduling using neural networks
- Insertion techniques for the heuristic solution of the job shop problem
- On the application of insertion techniques for job shop problems with setup times
- Shop scheduling problems with multiprocessor tasks on dedicated processors
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
- Alternative graph formulation for solving complex factory-scheduling problems
- Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
- Mixed integer programming for scheduling surface mount technology lines
Cited In (13)
- The resource-constrained activity insertion problem with minimum and maximum time lags
- The blocking job shop with rail-bound transportation
- A neighborhood for complex job shop scheduling problems with regular objectives
- Scheduling coupled-operation jobs with exact time-lags
- The flexible blocking job shop with transfer and set-up times
- 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
- Coupled task scheduling with exact delays: literature review and models
- Efficient primal heuristic updates for the blocking job shop problem
- A sequencing approach for creating new train timetables
- A new neighborhood and tabu search for the blocking job shop
- Proactive, dynamic and multi-criteria scheduling of maintenance activities
- A survey of scheduling problems with no-wait in process
Recommendations
- Feasible job insertions in the multi-processor-task job shop 👍 👎
- A lower bound for the job insertion problem. 👍 👎
- Optimal job insertion in the no-wait job shop 👍 👎
- Complexity of the job insertion problem in multi-stage scheduling 👍 👎
- Insertion techniques for the heuristic solution of the job shop problem 👍 👎
This page was built for publication: Feasible insertions in job shop scheduling, short cycles and stable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856271)
