Scheduling project networks with resource constraints and time windows
Annals of Operations Research
Introduction to algorithms
Job shop scheduling by simulated annealing
Operations Research
A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
A two-machine flowshop sequencing problem with limited waiting time constraints
Computers and Industrial Engineering
Single machine scheduling subject to precedence delays
Discrete Applied Mathematics
Proceedings of the third international conference on Graphs and optimization
Scheduling Algorithms
Algorithms + Data Structures = Programs
Algorithms + Data Structures = Programs
Permutation flowshop scheduling problems with maximal and minimal time lags
Computers and Operations Research
Correctness of data representations involving heap data structures
ESOP'03 Proceedings of the 12th European conference on Programming
One-machine generalized precedence constrained scheduling problems
Operations Research Letters
Approximative procedures for no-wait job shop scheduling
Operations Research Letters
Computing minimal doubly resolving sets of graphs
Computers and Operations Research
A neighborhood search algorithm for one-machine scheduling problem with time lags
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Production scheduling with a memetic algorithm
International Journal of Innovative Computing and Applications
Generalized disjunctive constraint propagation for solving the job shop problem with time lags
Engineering Applications of Artificial Intelligence
An efficient memetic algorithm for solving the job shop scheduling problem
Computers and Industrial Engineering
Models and strategies for variants of the job shop scheduling problem
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Guided restarting local search for production planning
Engineering Applications of Artificial Intelligence
Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems
Journal of Mathematical Modelling and Algorithms
Proceedings of the Winter Simulation Conference
A multi-objective approach to the application of real-world production scheduling
Expert Systems with Applications: An International Journal
Computers and Operations Research
| Hi-index | 0.01 |
The job-shop with time-lags (JS|t) is defined as a job-shop problem with minimal and maximal delays between starting times of operations. In this article, time-lags between successive operations of the same job (JS|t"i","s"""i) are studied. This problem is a generalization of the job-shop problem (null minimal time-lags and infinite maximal time-lags) and the no-wait job-shop problem (null minimal and maximal time-lags). This article introduced a framework based on a disjunctive graph to modelize the problem and on a memetic algorithm for job sequence generation on machines. Our aim is to provide also a framework to cover both job-shop and flow-shop problem and to encompass both no-wait and classical instances. A benchmark has been carried out on medium scale instances proving that high quality solutions can be obtained in short computational time. The framework we introduce competes with some methods dedicated to the no-wait job-shop instances and flow-shop instances in terms of quality of results.