Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines

Marcin Żurowski ()
Additional contact information
Marcin Żurowski: Adam Mickiewicz University in Poznań

A chapter in Operations Research Proceedings 2017, 2018, pp 587-592 from Springer

Abstract: Abstract We consider a scheduling problem with a learning effect, where independent jobs are scheduled on two parallel identical machines. Jobs are preemptable but only a restricted preemption of a single job is allowed. The optimality criterion of a schedule is the maximum completion time. A few properties of the problem are presented and an exact algorithm solving this problem is proposed.

Keywords: Scheduling; Parallel identical machines; Learning effect; Job preemption; Maximum completion time (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-89920-6_78

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_78

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().