Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
type: Item
instance of: scholarly article
title: Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
zbMATH Open document ID: 1185.90065
author: Philippe Baptiste
author: F. Della Croce
author: Andrea Grosso
author: Vincent T'kindt
published in: Journal of Scheduling
publication date: 2010-05-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5705530
zbMATH Keywords: sequencing and scheduling
zbMATH Keywords: single machine
zbMATH Keywords: tardy jobs
zbMATH Keywords: deadlines
MaRDI profile type: Publication
full work available at URL: s10951-008-0092-6
OpenAlex ID: W2000672358
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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
cites work: Q4124328
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
cites work: Minimizing the weighted number of tardy jobs on a single machine
cites work: Minimizing the weighted number of tardy jobs on a single machine with release dates
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
cites work: Enumeration of Pareto optima for a flowshop scheduling problem with two criteria
DOI: 10.1007/S10951-008-0092-6
description: scientific article; zbMATH DE number 5705530