Single machine due window assignment resource allocation scheduling with job-dependent learning effect

This paper deals with a single machine common due window assignment resource allocation scheduling problem with job-dependent learning effect. The objective is to find the due window starting time, a due window size, resource allocation and a job schedule such that total resource consumption cost is...

Full description

Saved in:
Bibliographic Details
Published inJournal of applied mathematics & computing Vol. 56; no. 1-2; pp. 715 - 725
Main Author Yin, Na
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2018
Springer Nature B.V
Subjects
Applied mathematics
Computational Mathematics and Numerical Analysis
Job shops
Mathematical and Computational Engineering
Mathematics
Mathematics and Statistics
Mathematics of Computing
Original Research
Production scheduling
Resource allocation
Resource scheduling
Theory of Computation
Windows (intervals)
Single-machine
Resource allocation
90B35
Scheduling
Due-window
68M20
Learning effect
Online AccessGet full text

Cover

More Information
Summary:This paper deals with a single machine common due window assignment resource allocation scheduling problem with job-dependent learning effect. The objective is to find the due window starting time, a due window size, resource allocation and a job schedule such that total resource consumption cost is minimized subject to a cost function associated with the window location, window size, earliness, tardiness and makespan is less than or equal to a fixed constant number. We show that the problem can be solved in polynomial time. Some extensions of the problem are also given.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1598-5865
1865-2085
DOI:10.1007/s12190-017-1091-6