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

DOI10.1007/S10288-012-0201-4MaRDI QIDQ1935552zbMATHOpenAlexWikidataFDO

Authors Adam Janiak, Władysław Janiak, M. Y. Kovalyov, Frank Werner

Publication date 18 February 2013

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-012-0201-4

zbMATH Keywords

schedulingparallel machinesearliness-tardinessdue windowunit-time jobs

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Due-window assignment problems with unit-time jobs
• Due-window assignment with unit processing-time jobs
• Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
• Due-window assignment with identical jobs on parallel uniform machines
• Minmax scheduling problems with a common due-window

Cites work

• A column generation algorithm for the vehicle routing problem with soft time windows
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
• A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
• A survey of the state-of-the-art of common due date assignment and scheduling research
• An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
• An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
• Due window scheduling for parallel machines
• Due-window assignment with unit processing-time jobs
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
• Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
• On scheduling around large restrictive common due windows
• Optimal common due-date with limited completion time deviation
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Scheduling with a common due-window: polynomially solvable cases
• Survey Paper—Time Window Constrained Routing and Scheduling Problems

Cited in

(15)

• A multi-criteria scheduling with due-window assignment problem
• Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
• An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
• Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
• A Due-Window Determination In Minmax Scheduling Problems
• Scheduling identical jobs and due-window on uniform machines
• Due-window assignment problems with unit-time jobs
• Due window scheduling for parallel machines
• Parallel Processing and Applied Mathematics
• Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
• Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine
• Due-window assignment with identical jobs on parallel uniform machines
• A survey on scheduling problems with due windows
• Due-window assignment with unit processing-time jobs

This page was built for publication: Soft due window assignment and scheduling of unit-time jobs on parallel machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935552)