An Algorithm for Solving the Job-Shop Problem
From MaRDI portal
Publication:3833853
Recommendations
Cited in
(only showing first 100 items - show all)- Hybrid rollout approaches for the job shop scheduling problem
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
- One-machine rescheduling heuristics with efficiency and stability as criteria
- Two branch and bound algorithms for the permutation flow shop problem
- Extending the shifting bottleneck procedure to real-life applications
- The job shop scheduling problem: Conventional and new solution techniques
- The generalized shifting bottleneck procedure
- 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
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- Benchmarks for shop scheduling problems
- Analysis of the temporal decomposition procedure for scheduling with release and due dates
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Cellular control of manufacturing systems
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- 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
- Job-shop scheduling with convex models of operations
- Adjustment of heads and tails for the job-shop problem
- A decision support system for the resource constrained project scheduling problem
- Effective job shop scheduling through active chain manipulation
- A branch \(\&\) bound algorithm for the open-shop problem
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- Constraint-directed techniques for scheduling alternative activities
- Constraint propagation techniques for the disjunctive scheduling problem
- On not-first/not-last conditions in disjunctive scheduling
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
- Decomposition methods for large job shops
- Concurrent operations can be parallelized in scheduling multiprocessor job shop
- A tabu search approach to machine scheduling
- Constraint programming and operations research
- Theoretical expectation versus practical performance of Jackson's heuristic
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
- Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement
- Resource tardiness weighted cost minimization in project scheduling
- Insertion techniques for the heuristic solution of the job shop problem
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Deterministic job-shop scheduling: Past, present and future
- Constraint satisfaction problems: Algorithms and applications
- Job-shop scheduling with blocking and no-wait constraints
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- An improved shifting bottleneck procedure for the job shop scheduling problem
- A branch \& bound method for the general-shop problem with sequence dependent setup-times
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Nested partitions for the large-scale extended job shop scheduling problem
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
- A new lower bound for the job-shop scheduling problem
- Benchmarks for basic scheduling problems
- Applying tabu search to the job-shop scheduling problem
- A branch and bound algorithm for scheduling trains in a railway network
- An \(R||C_{\max}\) quantum scheduling algorithm
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- A complete 4-parametric complexity classification of short shop scheduling problems
- A linear programming-based method for job shop scheduling
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops
- A hybrid genetic algorithm for the job shop scheduling problem
- Petri net based scheduling
- Modelling and heuristics of FMS scheduling with multiple objectives
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
- Applying machine based decomposition in 2-machine flow shops
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
- A column generation model for a scheduling problem with maintenance constraints
- Immersed NURBS for CFD applications
- Dynamic resource allocation: a flexible and tractable modeling framework
- A genetic algorithm applied to a classic job-shop scheduling problem
- Complete Complexity Classification of Short Shop Scheduling
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
- Solving the job-shop scheduling problem optimally by dynamic programming
- An effective new island model genetic algorithm for job shop scheduling problem
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- scientific article; zbMATH DE number 4143765 (Why is no real title available?)
- scientific article; zbMATH DE number 4156186 (Why is no real title available?)
- Study on constraint scheduling algorithm for job shop problems with multiple constraint machines
- Depth-first heuristic search for the job shop scheduling problem
- scientific article; zbMATH DE number 4074799 (Why is no real title available?)
- scientific article; zbMATH DE number 4099024 (Why is no real title available?)
- A Computational Study of the Job-Shop Scheduling Problem
- Scheduling larger job shops: a decomposition approach
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- Mixed multigraph approach to scheduling jobs on machines of different types∗
- A dynamic job shop scheduling framework: a backward approach
- A game-theoretic control approach for job shops in the presence of disruptions
- Project scheduling with flexible resources: formulation and inequalities
- Measures of subproblem criticality in decomposition algorithms for shop scheduling
- A new approach to computing optimal schedules for the job-shop scheduling problem
This page was built for publication: An Algorithm for Solving the Job-Shop Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833853)
