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)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A branch and bound algorithm for the job-shop scheduling problem, Constraint programming and operations research, Exact method for the two-machine flow-shop problem with time delays, The job-shop problem and immediate selection, An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal, Energetic reasoning revisited: Application to parallel machine scheduling, Adjustment of heads and tails for the job-shop problem, Evolution based learning in a job shop scheduling environment, Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search, Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors, A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates, Depth-first heuristic search for the job shop scheduling 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, Arc-B-consistency of the inter-distance constraint, New single machine and job-shop scheduling problems with availability constraints, Job-shop scheduling: Computational study of local search and large-step optimization methods, Immersed NURBS for CFD Applications, A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time, A job-shop problem with one additional resource type, An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem, A new approach to computing optimal schedules for the job-shop scheduling problem, An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling, Flow shop scheduling with heterogeneous workers, Scheduling and constraint propagation, A hybrid genetic algorithm for the job shop scheduling problem, Sweep synchronization as a global propagation mechanism, Jackson's pseudo-preemptive schedule and cumulative scheduling problems, Scheduling a single machine to minimize a regular objective function under setup constraints, Jackson's semi-preemptive scheduling on a single machine, Modeling with Metaconstraints and Semantic Typing of Variables, Resource-constrained project scheduling: Notation, classification, models, and methods, Solving an integrated job-shop problem with human resource constraints, Deterministic job-shop scheduling: Past, present and future, Hybrid rollout approaches for the job shop scheduling problem, Using short-term memory to minimize the weighted number of late jobs on a single machine., 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, Inequality-sum: a global constraint capturing the objective function, Non-binary quantified CSP: Algorithms and modelling, Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties, Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates, Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem, Constraint propagation techniques for the disjunctive scheduling problem, The nonpermutation flowshop scheduling problem: adjustment and bounding procedures, Job-shop scheduling with blocking and no-wait constraints, On not-first/not-last conditions in disjunctive scheduling, A new LP-based lower bound for the cumulative scheduling problem, Tabu search for the job-shop scheduling problem with multi-purpose machines, Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results, A branch and bound to minimize the number of late jobs on a single machine with release time constraints
