Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
type: Item
instance of: scholarly article
title: Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
zbMATH Open document ID: 1177.90152
author: Boris Detienne
author: Éric Pinson
author: David Rivreau
published in: European Journal of Operational Research
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5645175
zbMATH Keywords: scheduling
zbMATH Keywords: just-in-time
zbMATH Keywords: elimination rules
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: exact method
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.02.005
OpenAlex ID: W4298056606
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Preemption in single machine earliness/tardiness scheduling
cites work: Ordonnancements à contraintes disjonctives
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem
cites work: Adjustment of heads and tails for the job-shop problem
cites work: Machine scheduling with earliness, tardiness and non-execution penalties
cites work: Validation of subgradient optimization
cites work: Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
cites work: An improved earliness--tardiness timing algorithm
cites work: Minimizing the earliness--tardiness costs on a single machine
cites work: Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
cites work: A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
cites work: Q4124328
cites work: A new approach to computing optimal schedules for the job-shop scheduling problem
cites work: Using short-term memory to minimize the weighted number of late jobs on a single machine.
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Q4796172
cites work: The one-machine problem with earliness and tardiness penalties
cites work: A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
cites work: New exact algorithms for one-machine earliness-tardiness scheduling
DOI: 10.1016/J.EJOR.2009.02.005
description: scientific article; zbMATH DE number 5645175