logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

An iterative heuristic for the single machine dynamic total completion time scheduling problem

delete1996-07-01
delete15
PRE
AI
S
Suresh Chand *
R
Rodney D. Traub
R
Reha Uzsoy
DOI：10.1016/0305-0548(95)00071-2delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We address the problem of scheduling a single machine to minimize the total completion time in the face of dynamic job arrivals. Since the problem is strongly NP-hard, considerable research has been devoted to examining one-pass heuristic procedures for this problem. In this paper we present an iterative improvement heuristic which operates by modifying the problem data in a manner that allows one-pass heuristics to generate improved solutions. Computational experiments show that the procedure obtains significant improvements over a variety of one-pass heuristics in modest CPU times. Copyright (C) 1996 Elsevier Science Ltd
Keywords:
TOTAL FLOW TIME
RELEASE DATES
ALGORITHM
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available