Skip to main navigation Skip to search Skip to main content

Scheduling N Jobs on one machine with insert-idle-time constraints

  • Yuan Geng Huang
  • , Laveen N. Kanal
  • , Satish K. Tripathi
  • University of Maryland, College Park

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

A new scheduling problem, which is called the insert-idle-time scheduling problem, is proposed which concerns scheduling N jobs on one machine when some of the machine time is unschedulable due to pre-scheduled maintenance time, lunch time or the time devoted to the jobs with higher priority or any other activities. An best-first branch-and-bound algorithm which takes "schedule improvement" approach is presented and the experimental results are reported.

Original languageEnglish
Title of host publicationProceedings of the 2nd International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 1989
EditorsMoonis Ali
PublisherAssociation for Computing Machinery, Inc
Pages344-347
Number of pages4
ISBN (Electronic)0897913205, 9780897913201
DOIs
StatePublished - Jun 6 1989
Event2nd International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 1989 - Tullahoma, United States
Duration: Jun 6 1989Jun 9 1989

Publication series

NameProceedings of the 2nd International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 1989

Conference

Conference2nd International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 1989
Country/TerritoryUnited States
CityTullahoma
Period06/6/8906/9/89

Fingerprint

Dive into the research topics of 'Scheduling N Jobs on one machine with insert-idle-time constraints'. Together they form a unique fingerprint.

Cite this