A branch and bound to minimize the number of late jobs on a single machine with release time constraints
type: Item
instance of: scholarly article
title: A branch and bound to minimize the number of late jobs on a single machine with release time constraints
zbMATH Open document ID: 1037.90022
DOI: 10.1016/S0377-2217(01)00353-8
author: Philippe Baptiste
author: Éric Pinson
author: Laurent Peridy
published in: European Journal of Operational Research
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1902789
zbMATH Keywords: Single machine scheduling
zbMATH Keywords: number of late jobs
zbMATH Keywords: branch and bound
zbMATH Keywords: dominance properties
zbMATH Keywords: elimination rules
MaRDI profile type: Publication
cites work: Q3056948
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: Constraint-based scheduling: Applying constraint programming to scheduling problems.
cites work: The job-shop problem and immediate selection
cites work: A branch and bound algorithm for the job-shop scheduling problem
cites work: The one-machine sequencing problem
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem
cites work: Adjustment of heads and tails for the job-shop problem
cites work: Solving various weighted matching problems with constraints
cites work: Minimizing late jobs in the general one machine scheduling problem
cites work: Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
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
cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
cites work: Q4055377
cites work: A new approach to computing optimal schedules for the job-shop scheduling problem
cites work: Q3738922
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
full work available at URL: s0377-2217(01)00353-8
OpenAlex ID: W2055770719
Recommended article: A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
Recommended article: A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
Recommended article: Q4016820
Recommended article: Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
Recommended article: Minimizing the weighted number of tardy jobs on a single machine with release dates
Recommended article: Minimizing the number of tardy job units under release time constraints
Recommended article: Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
Recommended article: A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
Recommended article: Q3993992
Recommended article: Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
description: scientific article; zbMATH DE number 1902789