Match-up scheduling under a machine breakdown

DOI10.1016/S0377-2217(97)00396-2MaRDI QIDQ1806884zbMATH OpenFDO

Authors M. Selim Aktürk, Elif Gorgulu

Publication date 14 June 2000

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

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)

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

Cites work

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

Cited in

(22)

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

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)