The job-shop problem and immediate selection
From MaRDI portal
Publication:1339120
DOI10.1007/BF02085636zbMath0826.90062OpenAlexW4236129682MaRDI QIDQ1339120
Peter Brucker, Bernd Jurisch, Andreas Krämer
Publication date: 1 December 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02085636
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Energetic reasoning revisited: Application to parallel machine scheduling, Adjustment of heads and tails for the job-shop problem, Optimal scheduling of a two-stage hybrid flow shop, A branch \(\&\) bound algorithm for the open-shop problem, A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags, A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times, A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time, A branch and bound method for the job-shop problem with sequence-dependent setup times, Scheduling and constraint propagation, Solving the open shop scheduling problem, Local adjustments: A general algorithm, A computational study of the permutation flow shop problem based on a tight lower bound, Resource-constrained project scheduling: Notation, classification, models, and methods, A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags, A branch and bound algorithm for the resource-constrained project scheduling problem, Constraint propagation techniques for the disjunctive scheduling problem, The nonpermutation flowshop scheduling problem: adjustment and bounding procedures, Analysis of the temporal decomposition procedure for scheduling with release and due dates, The disjunctive graph machine representation of the job shop scheduling problem, A branch and bound to minimize the number of late jobs on a single machine with release time constraints
Cites Work
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- The one-machine sequencing problem
- A branch and bound algorithm for the job-shop scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- A Computational Study of the Job-Shop Scheduling Problem
- An existence theorem for packing problems with implications for the computation of optimal machine schedules
