Scheduling a single machine to minimize a regular objective function under setup constraints
type: Item
instance of: scholarly article
title: Scheduling a single machine to minimize a regular objective function under setup constraints
zbMATH Open document ID: 1140.90390
author: Philippe Baptiste
author: Claude Le Pape
published in: Discrete Optimization
publication date: 2005-06-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2173498
zbMATH Keywords: Single machine scheduling
zbMATH Keywords: Sequencing
zbMATH Keywords: Setup time
zbMATH Keywords: Setup cost
zbMATH Keywords: Unperformed jobs
MaRDI profile type: Publication
full work available at URL: j.disopt.2004.12.003
OpenAlex ID: W2160008844
cites work: A survey of algorithms for the single machine total weighted tardiness scheduling problem
cites work: A new dominance rule to minimize total weighted tardiness with unequal release dates.
cites work: A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems.
cites work: A branch and bound to minimize the number of late jobs on a single machine with release time constraints
cites work: Scheduling with release dates on a single machine to minimize total weighted completion time
cites work: Scheduling of a single machine to minimize total weighted completion time subject to release dates
cites work: Q2734595
cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem
cites work: Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
cites work: On n/1/?? dynamic deterministic problems
cites work: On decomposition of the total tardiness problem
cites work: Q4017560
cites work: Q3993992
cites work: Efficient heuristics to minimize total flow time with release dates
cites work: Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
cites work: On Scheduling with Ready Times to Minimize Mean Flow Time
cites work: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time
cites work: Q3217922
cites work: Q4124332
cites work: Accelerating filtering techniques for numeric CSPs
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: Technical Note—A Note on the Weighted Tardiness Problem
cites work: Minimizing Total Costs in One-Machine Scheduling
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: Earliness-tardiness scheduling with setup considerations
cites work: Solution of the single machine total tardiness problem
cites work: Algorithmic paradoxes of the single-machine total tardiness problem
DOI: 10.1016/J.DISOPT.2004.12.003
description: scientific article; zbMATH DE number 2173498