On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929): Difference between revisions

Latest revision as of 12:31, 2 July 2024

scientific article; zbMATH DE number 5679202

Language	Label	Description	Also known as
English	On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation	scientific article; zbMATH DE number 5679202

Statements

instance of

scholarly article

0 references

title

On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (English)

0 references

0 references

0 references

Naval Research Logistics (NRL)

0 references

publication date

9 March 2010

0 references

zbMATH Keywords

mixed integer program

0 references

scheduling

0 references

earliness

0 references

tardiness

0 references

describes a project that uses

OR-Library

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1002/nav.20352

0 references

cites work

A new dominance rule to minimize total weighted tardiness with unequal release dates.

0 references

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

0 references

Scheduling equal-length jobs on identical parallel machines

0 references

A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates

0 references

A branch and bound to minimize the number of late jobs on a single machine with release time constraints

0 references

Scheduling with release dates on a single machine to minimize total weighted completion time

0 references

Scheduling of a single machine to minimize total weighted completion time subject to release dates

0 references

Time-Indexed Formulations and the Total Weighted Tardiness Problem

0 references

The Schedule-Sequencing Problem

0 references

Scheduling jobs with equal processing times and time windows on identical parallel machines

0 references

Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm

0 references

On decomposition of the total tardiness problem

0 references

Q4017560

0 references

Q3993992

0 references

Efficient heuristics to minimize total flow time with release dates

0 references

Genetic algorithms to minimize the weighted number of late jobs on a single machine.

0 references

On Scheduling with Ready Times to Minimize Mean Flow Time

0 references

Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time

0 references

Minimizing Total Tardiness on One Machine is NP-Hard

0 references

Formulating the single machine sequencing problem with release dates as a mixed integer program

0 references

One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

0 references

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

0 references

An algorithm for single machine sequencing with release dates to minimize total weighted completion time

0 references

Q4124332

0 references

A decomposition algorithm for the single machine total tardiness problem

0 references

Technical Note—A Note on the Weighted Tardiness Problem

0 references

A mixed integer programming model for scheduling orders in a steel mill

0 references

Q4077716

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

Solution of the single machine total tardiness problem

0 references

Algorithmic paradoxes of the single-machine total tardiness problem

0 references

Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs

0 references

A polyhedral approach to single-machine scheduling problems.

0 references

Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties

0 references

Identifiers

zbMATH Open document ID

1182.90040

0 references

DOI

10.1002/nav.20352

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5187929

@@ Property / cites work @@
+A new dominance rule to minimize total weighted tardiness with unequal release dates.
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
+Normal rank
@@ Property / cites work @@
+Scheduling equal-length jobs on identical parallel machines
+Normal rank
@@ Property / cites work @@
+A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
+Normal rank
@@ Property / cites work @@
+A branch and bound to minimize the number of late jobs on a single machine with release time constraints
+Normal rank
@@ Property / cites work @@
+Scheduling with release dates on a single machine to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Scheduling of a single machine to minimize total weighted completion time subject to release dates
+Normal rank
@@ Property / cites work @@
+Time-Indexed Formulations and the Total Weighted Tardiness Problem
+Normal rank
@@ Property / cites work @@
+The Schedule-Sequencing Problem
@@ Property / cites work: The Schedule-Sequencing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling jobs with equal processing times and time windows on identical parallel machines
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
+Normal rank
@@ Property / cites work @@
+On decomposition of the total tardiness problem
@@ Property / cites work: On decomposition of the total tardiness problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4017560
@@ Property / cites work: Q4017560 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993992
@@ Property / cites work: Q3993992 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient heuristics to minimize total flow time with release dates
+Normal rank
@@ Property / cites work @@
+Genetic algorithms to minimize the weighted number of late jobs on a single machine.
+Normal rank
@@ Property / cites work @@
+On Scheduling with Ready Times to Minimize Mean Flow Time
+Normal rank
@@ Property / cites work @@
+Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+Formulating the single machine sequencing problem with release dates as a mixed integer program
+Normal rank
@@ Property / cites work @@
+One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
+Normal rank
@@ Property / cites work @@
+A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
+Normal rank
@@ Property / cites work @@
+An algorithm for single machine sequencing with release dates to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Q4124332
@@ Property / cites work: Q4124332 / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition algorithm for the single machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Technical Note—A Note on the Weighted Tardiness Problem
+Normal rank
@@ Property / cites work @@
+A mixed integer programming model for scheduling orders in a steel mill
+Normal rank
@@ Property / cites work @@
+Q4077716
@@ Property / cites work: Q4077716 / rank @@
+Normal rank
@@ Property / cites work @@
+Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+Solution of the single machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Algorithmic paradoxes of the single-machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
+Normal rank
@@ Property / cites work @@
+A polyhedral approach to single-machine scheduling problems.
+Normal rank
@@ Property / cites work @@
+Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
+Normal rank