Scheduling with time-of-use costs

•Detailed picture of computational tractability for the scheduling problems at hand.•Efficient algorithms for tractable problems.•A fully polynomial-time approximation scheme for an intractable problem. We address a class of problems of scheduling a set of independent jobs onto a single machine that...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 274; no. 3; pp. 900 - 908
Main Authors:	Chen, Bo, Zhang, Xiandong
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.05.2019
Subjects:	Computational complexity Efficient algorithm Polynomial-time approximation scheme Scheduling Time-of-use cost Scheduling Computational complexity Polynomial-time approximation scheme Time-of-use cost Efficient algorithm
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!