Single machine scheduling and due date assignment with positionally dependent processing times

We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due da...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 198; no. 1; pp. 57 - 62
Main Authors:	Gordon, Valery S., Strusevich, Vitaly A.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.10.2009 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Applied sciences Assignment problem Common due date assignment Deadlines Dynamic programming Exact sciences and technology Inventory control, production control. Distribution Job shops Logistics Mathematical programming Operational research and scientific management Operational research. Management science Optimization algorithms Positionally dependent processing times Production scheduling Scheduling, sequencing Single machine scheduling Single machine scheduling Common due date assignment SLK due date assignment Positionally dependent processing times SLK due date assignment Studies Positionally dependent processing times Common due date assignment SLK due date assignment Single machine scheduling Processing time Scheduling Polynomial method Modeling Due date Polynomial time Time dependence Cooperation Cost function Matrix polynomial Earliness Objective function Dynamic programming Single machine Logistics Mathematical programming Execution time
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!