Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080)

scientific article; zbMATH DE number 5078389

Language	Label	Description	Also known as
English	Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach	scientific article; zbMATH DE number 5078389

Statements

instance of

scholarly article

0 references

title

Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (English)

0 references

0 references

0 references

Applied Mathematics and Computation

0 references

publication date

7 December 2006

0 references

zbMATH Keywords

earliness--tardiness scheduling

0 references

incompatible families

0 references

MIP formulation

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1016/j.amc.2006.01.068

0 references

cites work

The complexity of scheduling job families about a common due date

0 references

Scheduling with batch setup times and earliness-tardiness penalties

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

Multicriteria scheduling problems: a survey

0 references

Minimizing the average deviation of job completion times about a common due date

0 references

Single- and multiple-processor models for minimizing completion time variance

0 references

Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date

0 references

Scheduling job families about an unrestricted common due date on a single machine

0 references

Minimizing mean absolute deviation of completion times about a common due date

0 references

Single-machine scheduling to minimize absolute deviation of completion times from a common due date

0 references

The weighted common due date single machine scheduling problem revisited

0 references

Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date

0 references

A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date

0 references

Single machine weighted earliness-tardiness penalty problem with a common due date

0 references

Q3793928

0 references

Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties

0 references

Due-date assignment and early/tardy scheduling on identical parallel machines

0 references

The parallel machine min-max weighted absolute lateness scheduling problem

0 references

Due window scheduling for parallel machines

0 references

Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs

0 references

Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs

0 references

Scheduling under a common due-date on parallel unrelated machines

0 references

Solving Parallel Machine Scheduling Problems by Column Generation

0 references

Early/tardy scheduling with sequence dependent setups on uniform parallel machines

0 references

Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times

0 references

Identifiers

zbMATH Open document ID

1119.68038

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.AMC.2006.01.068

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:856080