Adjustment of heads and tails for the job-shop problem
From MaRDI portal
Publication:1341994
DOI10.1016/0377-2217(94)90379-4zbMath0812.90063MaRDI QIDQ1341994
Publication date: 11 January 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90379-4
90B35: Deterministic scheduling theory in operations research
Related Items
Alternative graph formulation for solving complex factory-scheduling problems, Constraint-Level Advice for Shaving, Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments, Solving the open shop scheduling problem, Scheduling and constraint propagation, Jackson's pseudo-preemptive schedule and cumulative scheduling problems, Local adjustments: A general algorithm, Energetic reasoning revisited: Application to parallel machine scheduling, Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities, Optimal scheduling of a two-stage hybrid flow shop, 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, A constraint programming approach for the resource-constrained project 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, An efficient algorithm for the job-shop problem with two jobs, Two branch and bound algorithms for the permutation flow shop problem, The job shop scheduling problem: Conventional and new solution techniques, Reduction of job-shop problems to flow-shop problems with precedence constraints, Heuristics for scheduling with inventory: Dynamic focus via constraint criticality, Constraint-directed techniques for scheduling alternative activities, Constraint propagation techniques for the disjunctive scheduling problem, The disjunctive graph machine representation of the job shop 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, Local search with constraint propagation and conflict-based heuristics, A tabu search approach to machine scheduling, A computational study of the permutation flow shop problem based on a tight lower bound, 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, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, A branch and bound algorithm for scheduling trains in a railway network, Strong polynomiality of resource constraint propagation, Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- An adaptive branching rule for the permutation flow-shop problem
- The one-machine sequencing problem
- The job-shop problem and immediate selection
- Scheduling the General Job-Shop
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Minimizing maximum lateness on one machine: computational experience and some applications
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
