Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
From MaRDI portal
Cited in
(74)- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- One-machine rescheduling heuristics with efficiency and stability as criteria
- A unified formulation of the machine scheduling problem
- The job shop scheduling problem: Conventional and new solution techniques
- On a multiconstrained model for chromatic scheduling
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- Benchmarks for shop scheduling problems
- 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
- Effective job shop scheduling through active chain manipulation
- Mixed graph colorings
- A repairing technique for the local search of the job-shop problem.
- Heuristics for minimizing total weighted tardiness in flexible flow shops
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- Decomposition methods for large job shops
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- A tabu search approach to machine scheduling
- A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
- Complexity, bounds and dynamic programming algorithms for single track train scheduling
- The job shop scheduling problem with convex costs
- A new hybrid genetic algorithm for job shop scheduling problem
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Deterministic job-shop scheduling: Past, present and future
- Job-shop scheduling with resource-time models of operations
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Job-shop scheduling with blocking and no-wait constraints
- Two alternative models for farm management: Discrete versus continuous time horizon
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- A new energy-aware flexible job shop scheduling method using modified biogeography-based optimization
- A clique search problem and its application to machine scheduling
- A logic-based Benders decomposition for microscopic railway timetable planning
- Considering project management activities for engineering design groups
- Nested partitions for the large-scale extended job shop scheduling problem
- A tabu search experience in production scheduling
- Routing and scheduling in a flexible job shop by tabu search
- The project scheduling polyhedron: Dimension, facets and lifting theorems
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
- A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem
- A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
- Ant colony optimisation with parameterised search space for the job shop scheduling problem
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- An exact decomposition approach for the real-time train dispatching problem
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Bounds and initial solutions for frame ineration in machine scheduling
- Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- The durations ofmprojects for achieving minimization of cost and optimal resource allocation
- A dynamic job shop scheduling framework: a backward approach
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling
- Measures of subproblem criticality in decomposition algorithms for shop scheduling
- Dynamical Neural Network Approach to the Job-shop Scheduling
- Fuzzy job-shop scheduling problems: a review
- A noncompact formulation for job-shop scheduling problems in traffic management
- An tentative taboo search algorithm for job shop scheduling
- A fluid approach to large volume job shop scheduling
- Modeling combinatorial disjunctive constraints via junction trees
- Improving branch and bound for jobshop scheduling with constraint propagation
- Scheduling in manufacturing with transportation: classification and solution techniques
- Two-stage stochastic/robust scheduling based on permutable operation groups
- Fifty years of research on resource-constrained project scheduling explored from different perspectives
- Geographic decompositions in railway timetable planning: modelling and computational assessment
- Fifty years of research in scheduling -- theory and applications
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
- Permutation-induced acyclic networks for the job shop scheduling problem
- Minimizing total weighted tardiness in a generalized job shop
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- A filter-and-fan approach to the job shop scheduling problem
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
This page was built for publication: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5575251)
