Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times

Ji-Bo Wang, Bo Cui, Ping Ji and Wei-Wei Liu ()
Additional contact information
Ji-Bo Wang: Shenyang Aerospace University
Bo Cui: Shenyang Aerospace University
Ping Ji: The Hong Kong Polytechnic University
Wei-Wei Liu: Shenyang Sport University

Journal of Combinatorial Optimization, 2021, vol. 41, issue 2, No 2, 290-303

Abstract: Abstract This article studies scheduling problems with past-sequence-dependent delivery times (denoted by psddt) on a single-machine, i.e., the delivery time of a job depends on its waiting time of processing. We prove that the total (discounted) weighted completion time minimization can be solved in $$O(n\log n)$$ O ( n log n ) time, where n is the number of jobs, and the weight is a position-dependent weight. For common (denoted by con) and slack (denoted by slk) due-date assignment and position-dependent weights (denoted by pdw), we prove that an objective cost minimization is solvable in $$O(n\log n)$$ O ( n log n ) time. The model (i.e., psddt and pdw) can also be extended to position-dependent (time-dependent) processing times.

Keywords: Delivery time; Position-dependent weight; Single-machine; Scheduling (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00676-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jcomop:v:41:y:2021:i:2:d:10.1007_s10878-020-00676-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00676-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().