Single-machine group technology scheduling with resource allocation and slack due window assignment including minmax criterion

Dan-Yang Lv and Ji-Bo Wang

Journal of the Operational Research Society, 2025, vol. 76, issue 8, 1696-1712

Abstract: The minmax problem for scheduling of group technology with slack due to window assignment under single-machine is investigated. That is, jobs are divided into the same group for continuous processing with similar production characteristics, and resources are allocated to each job to reduce the processing time based on the slack due window of each group, which can be expressed in the form of linear (including compression rate) and convex (including lower bounds on the processing time) functions of the resources, with the objective of minimizing the sum of the maximum slack due window cost (including earliness/tardiness, common flow allowance, and window size) and total resource allocation. Firstly, it is verified that the minimized maximum window cost is polynomial-time solvable for constant processing time. Next, polynomial-time solution algorithms for the target cost are proposed for the special case where the function coefficients are group-position-dependent. Third, for the general case where the coefficients are group-position-independent, an NEH-based heuristic algorithm is proposed, under the consideration of the processing times associated with the two resources, which are used as the upper bound for the branch-and-bound algorithm. Finally, a computational study of the random data is conducted to verify the effectiveness of the proposed algorithms.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2024.2430351 (text/html)
Access to full text is restricted to subscribers.

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:taf:tjorxx:v:76:y:2025:i:8:p:1696-1712

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2024.2430351

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().