Match-up scheduling under a machine breakdown

DOI10.1016/S0377-2217(97)00396-2zbMATH Open0937.90029MaRDI QIDQ1806884FDOQ1806884

Authors: M. Selim Aktürk, Elif Gorgulu 

Publication date: 14 June 2000

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

Recommendations

• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• Parallel machine match-up scheduling with manufacturing cost considerations
• One-machine rescheduling heuristics with efficiency and stability as criteria
• Rescheduling job shops under random disruptions

zbMATH Keywords

heuristicsschedulingbranch and bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Single machine flow-time scheduling with a single breakdown
• Minimizing Total Tardiness on One Machine is NP-Hard
• Single machine flow-time scheduling with scheduled maintenance
• Title not available (Why is that?)
• 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
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• Title not available (Why is that?)
• The Total Tardiness Problem: Review and Extensions
• A Review of Production Scheduling
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• Part-machine grouping using a multi-objective cluster analysis

Cited In (22)

• 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
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• Using real time information for effective dynamic scheduling
• Two machine scheduling under disruptions with transportation considerations
• Heuristic stability: a permutation disarray measure
• Rescheduling of identical parallel machines under machine eligibility constraints.
• Applying local rescheduling in response to schedule disruptions
• Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
• Project scheduling under uncertainty: survey and research potentials
• The construction of stable project baseline schedules
• Scheduling under machine breakdown in a continuous process industry
• Scheduling for stability in single-machine production systems
• Executing production schedules in the face of uncertainties: a review and some future directions
• Parallel machine match-up scheduling with manufacturing cost considerations
• A robust approach for the single machine scheduling problem
• Scheduling with unexpected machine breakdowns
• A survey of dynamic scheduling in manufacturing systems
• Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution
• Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems

This page was built for publication: Match-up scheduling under a machine breakdown

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806884)