Job-Shop Scheduling by Implicit Enumeration

DOI10.1287/MNSC.24.4.441MaRDI QIDQ4152322zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Bibliography

Mathematics Subject Classification ID

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)

Cited in

(38)

• Scheduling larger job shops: a decomposition approach
• Concurrent operations can be parallelized in scheduling multiprocessor job shop
• An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
• Immersed NURBS for CFD applications
• Effective job shop scheduling through active chain manipulation
• Job-shop scheduling with convex models of operations
• An effective hybrid optimization strategy for job-shop scheduling problems
• A modified shifting bottleneck procedure for job-shop scheduling
• Mathematical programming formulations for machine scheduling: A survey
• RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions.
• scientific article; zbMATH DE number 1271322 (Why is no real title available?)
• Job oriented production scheduling
• Reduction of job-shop problems to flow-shop problems with precedence constraints
• An adaptive branching rule for the permutation flow-shop problem
• New single machine and job-shop scheduling problems with availability constraints
• A neural network model for scheduling problems
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
• Dynamical Neural Network Approach to the Job-shop Scheduling
• Solving the job-shop scheduling problem optimally by dynamic programming
• Scheduling of project networks
• A time-indexed LP-based approach for min-sum job-shop problems
• Job-shop scheduling with resource-time models of operations
• A tabu search approach to machine scheduling
• Surrogate duality relaxation for job shop scheduling
• Multi-agent based beam search for intelligent production planning and scheduling
• An effective new island model genetic algorithm for job shop scheduling problem
• The job shop scheduling problem: Conventional and new solution techniques
• Extending the shifting bottleneck procedure to real-life applications
• An improved shifting bottleneck procedure for the job shop scheduling problem
• Optimal scheduling for flexible job shop operation
• Deterministic job-shop scheduling: Past, present and future
• A heuristic for scheduling general job shops to minimize maximum lateness
• Fuzzy job-shop scheduling problems: a review
• FMS scheduling based on timed Petri net model and reactive graph search
• A decomposition approach to multi-project scheduling
• A mixed integer program for loading and scheduling multiple flexible manufacturing cells
• A dynamic job shop scheduling framework: a backward approach
• A hybrid genetic algorithm for the job shop scheduling problem

This page was built for publication: Job-Shop Scheduling by Implicit Enumeration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152322)