Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine
Authors:
- 17 August 2021
- journal article
- research article
- Published by Taylor & Francis in Engineering Optimization
- Vol. 54 (11) , 1819-1834
Abstract
This article considers the minmax common due-window assignment in group scheduling with resource allocation on a single machine. In this problem, jobs are partitioned into groups. In a group, all jobs are processed contiguously, and a common due-window is assigned to them. First, a case with constant processing times is examined. The objective is to minimize the sum of the maximal costs arising from the common due-window among the jobs in each group. This problem is proved to be polynomially solvable. Next, the problem is extended to the case that includes resource allocation. The processing time of each job is considered as either a linear or a convex function of the quantity of resource allocation. The objective function considers the total resource-consumption cost and sum of the maximal costs. For the special case of group-position-dependent penalties, polynomial-time solutions are presented.Keywords
Funding Information
- National Science Foundation of China (71790614, B16009)
This publication has 42 references indexed in Scilit:
- Minmax scheduling problems with common flow-allowanceJournal of the Operational Research Society, 2012
- Soft due window assignment and scheduling of unit-time jobs on parallel machines4OR, 2012
- Single-machine group scheduling with resource allocation and learning effectComputers & Industrial Engineering, 2011
- Optimal due date assignment and resource allocation in a group technology scheduling environmentComputers & Operations Research, 2010
- Scheduling with a common due-window: Polynomially solvable casesInformation Sciences, 2010
- Due windows group scheduling using an effective hybrid optimization approachThe International Journal of Advanced Manufacturing Technology, 2009
- Minmax scheduling problems with a common due-windowComputers & Operations Research, 2009
- A survey of scheduling with controllable processing timesDiscrete Applied Mathematics, 2007
- A common due-date assignment problem on parallel identical machinesComputers & Operations Research, 2001
- Two Single Machine Sequencing Problems Involving Controllable Job Processing TimesA I I E Transactions, 1980