A survey on scheduling problems with due windows (Q2630089)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A survey on scheduling problems with due windows	scientific article

Statements

scholarly article

0 references

A survey on scheduling problems with due windows (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.ejor.2014.09.043

0 references

0 references

Wladyslaw Janiak

0 references

0 references

Tomasz Kwiatkowski

0 references

European Journal of Operational Research

0 references

publication date

25 July 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

scheduling

0 references

due windows

0 references

due window assignment

0 references

earliness/tardiness

0 references

number of early and tardy jobs

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

0 references

Scheduling under a common due-date on parallel unrelated machines

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

Single-machine scheduling with learning considerations

0 references

On scheduling around large restrictive common due windows

0 references

Single-machine scheduling against due dates with past-sequence-dependent setup times

0 references

Common due date scheduling with autonomous and induced learning

0 references

Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan

0 references

A bi-criteria two-machine flowshop scheduling problem with a learning effect

0 references

Parallel machine scheduling with a common due window

0 references

Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs

0 references

A concise survey of scheduling with time-dependent processing times

0 references

Survey of scheduling research involving due date determination decisions

0 references

A recovering beam search algorithm for the single machine just-in-time scheduling problem

0 references

Ship scheduling with soft time windows: An optimisation based approach

0 references

`` Strong '' NP-Completeness Results

0 references

Due-window assignment with identical jobs on parallel uniform machines

0 references

A survey of the state-of-the-art of common due date assignment and scheduling research

0 references

Single machine scheduling and due date assignment with positionally dependent processing times

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Multicriteria scheduling

0 references

Parallel machine scheduling with common due windows

0 references

Mirror image property for the optimal solutions of two single processor scheduling problems with due intervals determination

0 references

Soft due window assignment and scheduling of unit-time jobs on parallel machines

0 references

Scheduling Problems with Learning and Ageing Effects: A Survey

0 references

0 references

Parallel Processing and Applied Mathematics

0 references

Single-machine scheduling problems with actual time-dependent and job-dependent learning effect

0 references

Single-machine scheduling with time windows and earliness/tardiness penalties

0 references

Maximizing the weighted number of on-time jobs in single machine scheduling with time windows

0 references

Fixed interval scheduling: models, applications, computational complexity and algorithms

0 references

Due window scheduling for parallel machines

0 references

Exact and approximation algorithms for the operational fixed interval scheduling problem

0 references

Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect

0 references

Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties

0 references

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

0 references

Machine scheduling with a rate-modifying activity

0 references

Improving fleet utilization for carriers by interval scheduling

0 references

A unified approach for scheduling with convex resource consumption functions using positional penalties

0 references

The parallel machine min-max weighted absolute lateness scheduling problem

0 references

Determination of common due window location in a single machine scheduling problem

0 references

A single machine scheduling problem with common due window and controllable processing times

0 references

Common due window size and location determination in a single machine scheduling problem

0 references

Earliness-tardiness scheduling problems with a common delivery window

0 references

An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

0 references

A Due-Window Determination In Minmax Scheduling Problems

0 references

Scheduling problems with a learning effect

0 references

Due-window assignment with unit processing-time jobs

0 references

0 references

A due-window assignment problem with position-dependent processing times

0 references

A multi-criteria scheduling with due-window assignment problem

0 references

Minmax scheduling problems with a common due-window

0 references

Scheduling a maintenance activity and due-window assignment on a single machine

0 references

Scheduling identical jobs and due-window on uniform machines

0 references

Scheduling with a common due-window: polynomially solvable cases

0 references

New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria

0 references

Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine

0 references

Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains

0 references

Network flow approaches to pre-emptive open-shop scheduling problems with time-windows

0 references

A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows

0 references

The just-in-time scheduling problem in a flow-shop scheduling system

0 references

The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

0 references

A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags

0 references

Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties

0 references

Punctuality and idleness in just-in-time scheduling

0 references

Interval scheduling: A survey

0 references

A new MIP model for mine equipment scheduling by minimizing maintenance cost

0 references

Due dates assignment and JIT scheduling with equal-size jobs

0 references

Single machine scheduling with symmetric earliness and tardiness penalties

0 references

Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties

0 references

Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs

0 references

A note on scheduling problems with learning effect and deteriorating jobs

0 references

Single-machine due-window assignment problem with learning effect and deteriorating jobs

0 references

Flow-shop scheduling with a learning effect

0 references

Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan

0 references

Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times

0 references

Optimal common due-date with completion time tolerance

0 references

A makespan study of the two-machine flowshop scheduling problem with a learning effect

0 references

Optimal single-machine scheduling about a common due window with earliness/tardiness and additional penalties

0 references

Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration

0 references

Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance

0 references

Learning and forgetting effects on a group scheduling problem

0 references

Minimizing weighted number of early and tardy jobs with a common due window involving location penalty

0 references

Single-machine scheduling with a common due window

0 references

Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

0 references

A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2630089

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2630089&oldid=36263539"