Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
type: Item
instance of: scholarly article
title: Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
zbMATH Open document ID: 1391.90308
author: Bruno Ferreira Rosa
author: Sérgio Ricardo de Souza
author: Moacir Felizardo de França Filho
author: Zacharie Ales
author: Philippe Michelon
author: M. J. F. Souza
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6901385
zbMATH Keywords: scheduling
zbMATH Keywords: makespan
zbMATH Keywords: idle time
zbMATH Keywords: enumeration algorithm
describes a project that uses: Tabu search
Wikidata QID: Q56524159
MaRDI profile type: Publication
full work available at URL: j.cor.2016.12.024
OpenAlex ID: W2561796286
cites work: The third comprehensive survey on scheduling problems with setup times/costs
cites work: A survey of scheduling problems with setup times or costs
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Single-machine scheduling with early and tardy completion costs
cites work: Greedy randomized adaptive search procedures
cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
cites work: Q4354785
cites work: Algorithms for single machine total tardiness scheduling with sequence dependent setups
cites work: A survey on scheduling problems with due windows
cites work: Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
cites work: Single-machine scheduling with time windows and earliness/tardiness penalties
cites work: A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
cites work: Q4452900
cites work: Variable neighborhood search
cites work: Scheduling
cites work: A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
cites work: Optimal timing schedules in earliness-tardiness single machine sequencing
cites work: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
cites work: Algorithms for a class of single-machine weighted tardiness and earliness problems
DOI: 10.1016/J.COR.2016.12.024
description: scientific article; zbMATH DE number 6901385