Optimal restricted due date assignment in scheduling (Q322834)

!

WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use the normal view instead:

Optimal restricted due date assignment in scheduling

scientific article; zbMATH DE number 6636199

Language	Label	Description	Also known as
default for all languages	No label defined
English	Optimal restricted due date assignment in scheduling	scientific article; zbMATH DE number 6636199

Statements

instance of

scholarly article

0 references

title

Optimal restricted due date assignment in scheduling (English)

0 references

author

Dvir Shabtay

0 references

published in

European Journal of Operational Research

0 references

publication date

7 October 2016

0 references

zbMATH Keywords

scheduling

0 references

due date assignment

0 references

approximation algorithms

0 references

earliness

0 references

tardiness

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2015.12.043

0 references

cites work

Scheduling the Open Shop to Minimize Mean Flow Time

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

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

0 references

Q4535067

0 references

Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs

0 references

Single machine scheduling to minimize total weighted tardiness

0 references

Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

0 references

An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem

0 references

Single-machine scheduling with early and tardy completion costs

0 references

Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs

0 references

Minimizing Total Tardiness on One Machine is NP-Hard

0 references

Q4198056

0 references

The Complexity of Flowshop and Jobshop Scheduling

0 references

Q4667087

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

0 references

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

0 references

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

0 references

Machine scheduling with earliness, tardiness and non-execution penalties

0 references

Q4034337

0 references

Approximation algorithms for minimizing the total weighted tardiness on a single machine

0 references

Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

0 references

Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness

0 references

Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey

0 references

Optimal Sequencing of a Single Machine Subject to Precedence Constraints

0 references

Q4124332

0 references

Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints

0 references

A Functional Equation and its Application to Resource Allocation and Sequencing Problems

0 references

Scheduling unit-length jobs with machine eligibility restrictions

0 references

Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs

0 references

Q3840372

0 references

Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

0 references

Approximation algorithms for shop scheduling problems with minsum objective

0 references

Two due date assignment problems in scheduling a single machine

0 references

Optimal due date assignment in multi-machine scheduling environments

0 references

Parallel machine scheduling with earliness and tardiness penalties

0 references

Convex quadratic and semidefinite programming relaxations in scheduling

0 references

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

0 references

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

0 references

Identifiers

zbMATH Open document ID

1346.90387

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1016/J.EJOR.2015.12.043

0 references

Sitelinks

Mathematics(1 entry)

mardi Optimal restricted due date assignment in scheduling