Minimizing the number of tardy jobs for \(m\) parallel machines
type: Item
instance of: scholarly article
title: Minimizing the number of tardy jobs for \(m\) parallel machines
zbMATH Open document ID: 0927.90047
DOI: 10.1016/0377-2217(93)E0280-B
author: Johnny C. Ho
author: Yih-Long Chang
published in: European Journal of Operational Research
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 1189551
zbMATH Keywords: production scheduling
zbMATH Keywords: number of the tardy jobs
zbMATH Keywords: parallel machine
zbMATH Keywords: heuristic
MaRDI profile type: Publication
cites work: Scheduling with parallel processors and linear delay costs
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: A state-of-the-art review of parallel-machine scheduling research
cites work: Production scheduling of independent jobs on parallel identical processors
cites work: Q3793928
cites work: Q3938812
cites work: Q4198056
cites work: A Review of Production Scheduling
cites work: Heuristics for minimizing mean tardiness form parallel machines
cites work: Q5585020
cites work: Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: A parallel sequencing algorithm for minimizing total cost
cites work: On general routing problems
cites work: Scheduling with Deadlines and Loss Functions on k Parallel Machines
description: scientific article; zbMATH DE number 1189551