A practical use of Jackson's preemptive schedule for solving the job shop problem
From MaRDI portal
Publication:922282
zbMath0709.90061MaRDI QIDQ922282
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Inequality-sum: a global constraint capturing the objective function, A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates, Scheduling and constraint propagation, Jackson's pseudo-preemptive schedule and cumulative scheduling problems, Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results, Energetic reasoning revisited: Application to parallel machine scheduling, Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search, A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags, Arc-B-consistency of the inter-distance constraint, New single machine and job-shop scheduling problems with availability constraints, Hybrid rollout approaches for the job shop scheduling problem, Non-binary quantified CSP: Algorithms and modelling, Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates, Two branch and bound algorithms for the permutation flow shop problem, A computational study of constraint satisfaction for multiple capacitated job shop scheduling, The job shop scheduling problem: Conventional and new solution techniques, Tabu search for the job-shop scheduling problem with multi-purpose machines, A branch and bound algorithm for the job-shop scheduling problem, The job-shop problem and immediate selection, An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal, Adjustment of heads and tails for the job-shop problem, Evolution based learning in a job shop scheduling environment, Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors, Job-shop scheduling: Computational study of local search and large-step optimization methods, Constraint propagation techniques for the disjunctive scheduling problem, On not-first/not-last conditions in disjunctive scheduling, A new LP-based lower bound for the cumulative scheduling problem, Scheduling a single machine to minimize a regular objective function under setup constraints, Resource-constrained project scheduling: Notation, classification, models, and methods, Deterministic job-shop scheduling: Past, present and future, Using short-term memory to minimize the weighted number of late jobs on a single machine., Job-shop scheduling with blocking and no-wait constraints, A branch and bound to minimize the number of late jobs on a single machine with release time constraints, A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times, A hybrid genetic algorithm for the job shop scheduling problem, Sweep synchronization as a global propagation mechanism, Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
