Feasible insertions in job shop scheduling, short cycles and stable sets

DOI10.1016/J.EJOR.2005.12.025MaRDI QIDQ856271zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

schedulingjob shoppolyhedral descriptioninsertion problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• A heuristic to schedule flexible job-shop in a glass factory
• A lower bound for the job insertion problem.
• A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
• Alternative graph formulation for solving complex factory-scheduling problems
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Applying tabu search to the job-shop scheduling problem
• Approximative procedures for no-wait job shop scheduling.
• Effective neighbourhood functions for the flexible job shop problem
• Insertion techniques for static and dynamic resource-constrained project scheduling.
• Insertion techniques for the heuristic solution of the job shop problem
• Job Shop Scheduling by Local Search
• Job-shop scheduling using neural networks
• Job-shop scheduling with blocking and no-wait constraints
• Mixed integer programming for scheduling surface mount technology lines
• Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
• Multi-resource shop scheduling with resource flexibility
• On the application of insertion techniques for job shop problems with setup times
• Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
• Shop scheduling problems with multiprocessor tasks on dedicated processors
• Tabu-search for the multi-mode job-shop problem

Cited in

(15)

• A survey of scheduling problems with no-wait in process
• 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
• Feasible job insertions in the multi-processor-task job shop
• 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
• Complexity of the job insertion problem in multi-stage scheduling
• Proactive, dynamic and multi-criteria scheduling of maintenance activities

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)