Scheduling the General Job-Shop
From MaRDI portal
Recommendations
- A branch and bound algorithm for the job-shop scheduling problem
- Optimal job-shop scheduling with two jobs in systems with unrestricted paths
- Job-shop scheduling with resource-time models of operations
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Algorithms for Solving Production-Scheduling Problems
Cited in
(19)- Extending the shifting bottleneck procedure to real-life applications
- The job shop scheduling problem: Conventional and new solution techniques
- Practical job shop scheduling
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- Optimal job-shop scheduling with two jobs in systems with unrestricted paths
- Adjustment of heads and tails for the job-shop problem
- A fast finite loading algorithm for job oriented scheduling
- Job shop scheduling with deadlines
- Deterministic job-shop scheduling: Past, present and future
- Terminal inventory level constraints for online production scheduling
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
- A grasp for job shop scheduling
- Scheduling job shops with delays
- Locating Benefit Posts in Brazil
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- AI*IA 2005: Advances in Artificial Intelligence
- Algorithms for Solving Production-Scheduling Problems
- Job oriented production scheduling
This page was built for publication: Scheduling the General Job-Shop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750501)
