Hits:

Indexed by:Journal Papers

Date of Publication:2016-02-16

Journal:INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

Included Journals:EI、SCIE、Scopus

Volume:54

Issue:4

Page Number:1186-1195

ISSN No.:0020-7543

Key Words:scheduling; resource allocation; due window assignment

Abstract:This paper considers a single-machine scheduling problem involving convex resource-dependent processing times and due-window assignment simultaneously. The goal is to minimise the total resource consumption cost under the constraint that the schedule cost involving earliness, tardiness, window location, window size and makespan does not exceed a given limit for two popular due window assignment methods: the common flow allowance (slack) due window assignment method (referred to SLKW) and the common due window assignment method (referred to CONW). We show that the problem can be solved in polynomial time. Some extensions of the problem are also given.