Scheduling with Rate-Modifying Activities on Parallel Machines Under Various Effects

Vitaly A. Strusevich () and Kabir Rustogi
Additional contact information
Vitaly A. Strusevich: University of Greenwich
Kabir Rustogi: University of Greenwich

Chapter Chapter 20 in Scheduling with Time-Changing Effects and Rate-Modifying Activities, 2017, pp 433-451 from Springer

Abstract: Abstract Unlike in the preceding chapters of this part, in this chapter we turn to the models on parallel machines. The jobs of a set $$N=\left\{ 1,2,\dots ,n\right\} $$ N = 1 , 2 , ⋯ , n have to be processed on m parallel machines $$ M_{1},M_{2},\ldots ,M_{m}$$ M 1 , M 2 , … , M m , where $$m\le n$$ m ≤ n . Additionally, the decision-maker is presented with a list (RMP $$^{\left[ 1\right] }$$ 1 , RMP $$^{ \left[ 2\right] },\ldots ,$$ 2 , … , RMP $$^{\left[ K\right] }$$ K ) of $$K\ge 1$$ K ≥ 1 possible rate-modifying activities. The decision-maker may decide which of the listed RMPs to insert into a schedule, on which machine and in which order.

Date: 2017
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:isochp:978-3-319-39574-6_20

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

DOI: 10.1007/978-3-319-39574-6_20

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().