One-machine rescheduling heuristics with efficiency and stability as criteria
From MaRDI portal
Publication:1201849
DOI10.1016/0305-0548(93)90091-VzbMath0759.90049MaRDI QIDQ1201849
Pei-Chann Chang, S. David Wu, Robert H. Storer
Publication date: 17 January 1993
Published in: Computers \& Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (33)
The construction of stable project baseline schedules ⋮ SIMULEX -- a multiattribute DSS to solve rescheduling problems ⋮ Scheduling for stability in single-machine production systems ⋮ A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties ⋮ Robust optimization for the cyclic hoist scheduling problem ⋮ Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns ⋮ Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance ⋮ Improving schedule stability in single-machine rescheduling for new operation insertion ⋮ A hybrid multi-objective immune algorithm for predictive and reactive scheduling ⋮ The discrete time-cost tradeoff problem revisited ⋮ Predictive-reactive strategy for identical parallel machine rescheduling ⋮ Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems ⋮ Predictive-reactive scheduling for single surgical suite subject to random emergency surgery ⋮ EA/G-GA for single machine scheduling problems with earliness/tardiness costs ⋮ Rescheduling of identical parallel machines under machine eligibility constraints. ⋮ Single-machine multi-agent scheduling problems with a global objective function ⋮ Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption ⋮ Rescheduling for machine disruption to minimize makespan and maximum lateness ⋮ Meta-heuristics for stable scheduling on a single machine ⋮ Predictive-reactive scheduling on a single resource with uncertain future jobs ⋮ The complexity of machine scheduling for stability with a single disrupted job ⋮ Project scheduling under uncertainty: survey and research potentials ⋮ A survey of dynamic scheduling in manufacturing systems ⋮ Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times ⋮ Match-up scheduling under a machine breakdown ⋮ A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization ⋮ Analysis of reactive deadlock-free scheduling in flexible job shops ⋮ Optimally rescheduling jobs with a last-in-first-out buffer ⋮ Resource allocation by means of project networks: Complexity results ⋮ A production rescheduling expert simulation system ⋮ An investigation of alternative dampening procedures to cope with MRP system nervousness ⋮ Using real time information for effective dynamic scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The one-machine sequencing problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- A Direct Search Method to Locate Negative Cycles in a Graph
This page was built for publication: One-machine rescheduling heuristics with efficiency and stability as criteria
