Soft due window assignment and scheduling of unit-time jobs on parallel machines
type: Item
instance of: scholarly article
title: Soft due window assignment and scheduling of unit-time jobs on parallel machines
zbMATH Open document ID: 1261.68034
author: Adam Janiak
author: Władysław Janiak
author: M. Y. Kovalyov
author: Frank Werner
published in: 4OR
publication date: 2013-02-18T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6136989
zbMATH Keywords: scheduling
zbMATH Keywords: parallel machines
zbMATH Keywords: earliness-tardiness
zbMATH Keywords: due window
zbMATH Keywords: unit-time jobs
Wikidata QID: Q57633854
MaRDI profile type: Publication
full work available at URL: s10288-012-0201-4
OpenAlex ID: W1964110975
cites work: On scheduling around large restrictive common due windows
cites work: Optimal common due-date with limited completion time deviation
cites work: A survey of the state-of-the-art of common due date assignment and scheduling research
cites work: Recent progress of local search in handling the time window constraints of the vehicle routing problem
cites work: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
cites work: An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
cites work: A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
cites work: Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
cites work: Due window scheduling for parallel machines
cites work: An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
cites work: A column generation algorithm for the vehicle routing problem with soft time windows
cites work: Due-window assignment with unit processing-time jobs
cites work: Scheduling with a common due-window: polynomially solvable cases
cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems
cites work: A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
DOI: 10.1007/S10288-012-0201-4
description: scientific article; zbMATH DE number 6136989