Minimizing the weighted number of tardy jobs on a single machine with release dates
type: Item
instance of: scholarly article
title: Minimizing the weighted number of tardy jobs on a single machine with release dates
zbMATH Open document ID: 1103.90045
author: Robert L. Bulfin
author: Rym M'Hallah
published in: European Journal of Operational Research
publication date: 2006-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5073082
zbMATH Keywords: scheduling
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: branch and bound
zbMATH Keywords: surrogate relaxation
MaRDI profile type: Publication
full work available at URL: j.ejor.2005.08.013
OpenAlex ID: W1989488450
cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
cites work: An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
cites work: A branch and bound to minimize the number of late jobs on a single machine with release time constraints
cites work: Minimizing late jobs in the general one machine scheduling problem
cites work: Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
cites work: An exact method to minimize the number of tardy jobs in single machine scheduling
cites work: An O(n) algorithm for the multiple-choice knapsack linear program
cites work: A dual algorithm for the one-machine scheduling problem
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4142699
cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
cites work: Q4099215
cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
cites work: Q4055377
cites work: Minimizing the weighted number of tardy jobs on a single machine
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Q4040299
cites work: Using short-term memory to minimize the weighted number of late jobs on a single machine.
cites work: Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: Algorithms for Scheduling Independent Tasks
cites work: A Simple Optimality Proof of Moore's Sequencing Algorithm
cites work: A new branch and bound algorithm for minimizing the weighted number of tardy jobs
DOI: 10.1016/J.EJOR.2005.08.013
description: scientific article; zbMATH DE number 5073082