On a Single Machine Due Date Assignment and Scheduling Problem with the Rate-Modifying Activity

Valery S. Gordon () and Alexander A. Tarasevich ()
Additional contact information
Valery S. Gordon: National Academy of Sciences of Belarus
Alexander A. Tarasevich: National Academy of Sciences of Belarus

A chapter in Operations Research Proceedings 2005, 2006, pp 679-684 from Springer

Abstract: Abstract In this paper we consider single machine common due date assignment and scheduling problem. The objective is to minimize the total weighted sum of earliness, tardiness and due date costs. There exists a possibility to perform some action (rate-modifying activity) to change processing times of the jobs following this activity. Thus, placing the rate-modifying activity to some position in the schedule can decrease the objective function value. We consider several properties of the problem which in some cases can reduce the complexity of the solution algorithm.

Keywords: machine scheduling; common due date assignment; earliness; tardiness; rate-modifying activity. (search for similar items in EconPapers)
Date: 2006
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-540-32539-0_106

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

DOI: 10.1007/3-540-32539-5_106

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 ().