On optimal due date assignment without restriction and resource allocation in group technology scheduling

Ying Chen (), Xiaole Ma (), Guiqing Zhang () and Yongxi Cheng ()
Additional contact information
Ying Chen: Xi’an Jiaotong University
Xiaole Ma: CASIC Research Institute of Intelligent Decision Engineering
Guiqing Zhang: Xi’an Jiaotong University
Yongxi Cheng: Xi’an Jiaotong University

Journal of Combinatorial Optimization, 2023, vol. 45, issue 2, No 10, 19 pages

Abstract: Abstract A single machine group scheduling problem with due date assignment and resource allocation is investigated. Based on production similarities, jobs are classified into groups and it is required that jobs within the same group are processed contiguously, in order to achieve high-volume production efficiency. Jobs in the same group are allowed to have different due dates. The job processing times are resource dependent, and both convex and bounded linear resource consumption functions are considered. The aim is minimizing an aggregate cost which takes into account earliness, tardiness, due date assignment and resource allocation costs, by finding a group schedule, due date assignment and resource allocation for all jobs. For both resource consumption functions, we present properties of the optimal solutions, and for the special case where the size of every group is the same and the minimum of the due date assignment cost and the tardiness cost for each job is identical, we present an algorithm to optimally solve the problem in $$O(n^3)$$ O ( n 3 ) time, where n is the total number of jobs.

Keywords: Single machine scheduling; Due date assignment; Group technology; Resource allocation (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-00993-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:45:y:2023:i:2:d:10.1007_s10878-023-00993-z

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

DOI: 10.1007/s10878-023-00993-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 ().