Job-Shop Scheduling by Implicit Enumeration
From MaRDI portal
Publication:4152322
DOI10.1287/mnsc.24.4.441zbMath0373.90034OpenAlexW2069642733MaRDI QIDQ4152322
B. J. Lageweg, Alexander H. G. Rinnooy Kan, Jan Karel Lenstra
Publication date: 1977
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.24.4.441
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A mixed integer program for loading and scheduling multiple flexible manufacturing cells, An improved shifting bottleneck procedure for the job shop scheduling problem, Multi-agent based beam search for intelligent production planning and scheduling, Job-shop scheduling with convex models of operations, Effective job shop scheduling through active chain manipulation, Solving the job-shop scheduling problem optimally by dynamic programming, An effective new island model genetic algorithm for job shop scheduling problem, New single machine and job-shop scheduling problems with availability constraints, Dynamical Neural Network Approach to the Job-shop Scheduling, Immersed NURBS for CFD Applications, An adaptive branching rule for the permutation flow-shop problem, An agent-based parallel approach for the job shop scheduling problem with genetic algorithms, RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions., Scheduling of project networks, Job oriented production scheduling, A time-indexed LP-based approach for min-sum job-shop problems, Surrogate duality relaxation for job shop scheduling, FMS scheduling based on timed Petri net model and reactive graph search, Unnamed Item, Fuzzy job-shop scheduling problems: a review, An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling, A hybrid genetic algorithm for the job shop scheduling problem, A dynamic job shop scheduling framework: a backward approach, A heuristic for scheduling general job shops to minimize maximum lateness, An effective hybrid optimization strategy for job-shop scheduling problems, A modified shifting bottleneck procedure for job-shop scheduling, Optimal scheduling for flexible job shop operation, Deterministic job-shop scheduling: Past, present and future, Extending the shifting bottleneck procedure to real-life applications, A neural network model for scheduling problems, The job shop scheduling problem: Conventional and new solution techniques, Job-shop scheduling with resource-time models of operations, Reduction of job-shop problems to flow-shop problems with precedence constraints, Scheduling larger job shops: a decomposition approach, A decomposition approach to multi-project scheduling, Mathematical programming formulations for machine scheduling: A survey, Concurrent operations can be parallelized in scheduling multiprocessor job shop, A tabu search approach to machine scheduling
