An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs
type: Item
instance of: scholarly article
zbMATH Open document ID: 0846.90053
author: David John Robb
author: Thomas Rohleder
publication date: 1996-07-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 895000
zbMATH Keywords: adjacent pairwise interchange algorithm
MaRDI profile type: Publication
OpenAlex ID: W2031490108
title: An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs
Recommended article: A heuristic for single machine scheduling with early and tardy costs
Recommended article: Q4350084
Recommended article: Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
Recommended article: A composite heuristic for the single machine early/tardy job scheduling problem.
Recommended article: Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
Recommended article: Single-machine scheduling with early and tardy completion costs
Recommended article: A heuristic algorithm for dynamic task scheduling in highly parallel computing systems
Recommended article: A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling
Recommended article: An algorithm for constructing single processor static-dynamic schedules
DOI: 10.1002/(SICI)1520-6750(199604)43:3%3C349::AID-NAV3%3E3.0.CO;2-9
full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199604)43:3%3C349::aid-nav3%3E3.0.co
description: scientific article; zbMATH DE number 895000