Match-up scheduling under a machine breakdown
type: Item
instance of: scholarly article
title: Match-up scheduling under a machine breakdown
zbMATH Open document ID: 0937.90029
DOI: 10.1016/S0377-2217(97)00396-2
author: M. Selim Aktürk
author: Elif Gorgulu
published in: European Journal of Operational Research
publication date: 2000-06-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1358452
zbMATH Keywords: scheduling
zbMATH Keywords: heuristics
zbMATH Keywords: branch and bound
MaRDI profile type: Publication
cites work: Single machine flow-time scheduling with a single breakdown
cites work: Part-machine grouping using a multi-objective cluster analysis
cites work: Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
cites work: Q4023677
cites work: Q3993992
cites work: Minimizing Mean Flow Time With Release Time and Deadline Constraints
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: A Review of Production Scheduling
cites work: The Total Tardiness Problem: Review and Extensions
cites work: Machine scheduling with an availability constraint
cites work: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
cites work: Single machine flow-time scheduling with scheduled maintenance
cites work: Capacitated two-parallel machines scheduling to minimize sum of job completion times
cites work: One-machine rescheduling heuristics with efficiency and stability as criteria
description: scientific article; zbMATH DE number 1358452