A note: flowshop scheduling with linear deterioration and job-rejection

We study a scheduling problem on an m -machine flowshop with linear deterioration of job processing times and job rejection. The objectives are minimum makespan and minimum total load, subject to an upper bound on the total permitted rejection cost. The problems are NP-hard (since the single machine...

Full description

Saved in:

Bibliographic Details
Published in:	4OR Vol. 19; no. 1; pp. 103 - 111
Main Authors:	Mor, Baruch, Mosheiov, Gur
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2021 Springer Nature B.V
Subjects:	Algorithms Business and Management Dynamic programming Flow control Industrial and Production Engineering Operations research Operations Research/Decision Theory Optimization Polynomials Rejection Research Paper Scheduling Upper bounds 90B35 Deterministic scheduling theory in operations research Scheduling Job-rejection Flowshop Dynamic programming Linear deterioration
ISSN:	1619-4500, 1614-2411
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!