Match-up scheduling under a machine breakdown

DOI10.1016/S0377-2217(97)00396-2zbMath0937.90029MaRDI QIDQ1806884

M. Selim Akturk, Elif Gorgulu

Publication date: 14 June 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristics; scheduling; branch and bound

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

Applying local rescheduling in response to schedule disruptions, A robust approach for the single machine scheduling problem, Scheduling for stability in single-machine production systems, Two machine scheduling under disruptions with transportation considerations, Heuristic stability: a permutation disarray measure, Parallel machine match-up scheduling with manufacturing cost considerations, Rescheduling of identical parallel machines under machine eligibility constraints., Using real time information for effective dynamic scheduling, Scheduling under machine breakdown in a continuous process industry, Project scheduling under uncertainty: survey and research potentials, The construction of stable project baseline schedules, Executing production schedules in the face of uncertainties: a review and some future directions, A survey of dynamic scheduling in manufacturing systems, Meta-heuristics for stable scheduling on a single machine, The complexity of machine scheduling for stability with a single disrupted job, An anticipative scheduling approach with controllable processing times, Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption, Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Single machine flow-time scheduling with scheduled maintenance
• Single machine flow-time scheduling with a single breakdown
• One-machine rescheduling heuristics with efficiency and stability as criteria
• Capacitated two-parallel machines scheduling to minimize sum of job completion times
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• Machine scheduling with an availability constraint
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Review of Production Scheduling
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• Part-machine grouping using a multi-objective cluster analysis
• The Total Tardiness Problem: Review and Extensions