The one-machine just-in-time scheduling problem with preemption
type: Item
instance of: scholarly article
title: The one-machine just-in-time scheduling problem with preemption
zbMATH Open document ID: 1159.90020
author: Yann Hendel
author: Nina Runge
author: Francis Sourd
published in: Discrete Optimization
publication date: 2009-04-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5544684
zbMATH Keywords: single-machine scheduling
zbMATH Keywords: just-in-time
zbMATH Keywords: preemption
MaRDI profile type: Publication
full work available at URL: j.disopt.2008.08.001
OpenAlex ID: W2091592818
cites work: Solving the Convex Cost Integer Dual Network Flow Problem
cites work: Preemption in single machine earliness/tardiness scheduling
cites work: PERT scheduling with convex cost functions.
cites work: Single-machine scheduling with early and tardy completion costs
cites work: A recovering beam search algorithm for the single machine just-in-time scheduling problem
cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
cites work: Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
cites work: An improved earliness--tardiness timing algorithm
cites work: A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
cites work: Scheduling with target start times
cites work: Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
cites work: Q4124328
cites work: The one-machine problem with earliness and tardiness penalties
cites work: Optimal timing of a sequence of tasks with general completion costs
cites work: A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
cites work: Optimal timing schedules in earliness-tardiness single machine sequencing
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
DOI: 10.1016/J.DISOPT.2008.08.001
description: scientific article; zbMATH DE number 5544684