A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs
type: Item
instance of: scholarly article
title: A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs
zbMATH Open document ID: 0827.90075
DOI: 10.1016/0305-0548(94)00027-6
author: Chung-Lun Li
published in: Computers \& Operations Research
publication date: 1995-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 759305
zbMATH Keywords: identical parallel machines
zbMATH Keywords: different due dates and release times
MaRDI profile type: Publication
full work available at URL: 0305-0548(94)00027-6
OpenAlex ID: W2012377923
cites work: Q3995531
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
cites work: A Simple Optimality Proof of Moore's Sequencing Algorithm
cites work: Q5181074
cites work: Linear-Time Algorithms for Scheduling on Parallel Processors
cites work: Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
cites work: Q4198056
cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
description: scientific article; zbMATH DE number 759305