Single-machine scheduling with machine unavailability periods and resource dependent processing times

•We study a single-machine scheduling problem with a machine-unavailability period.•Processing times are resource-dependent.•The problem is known to be NP-hard.•We focus on the design of pseudo-polynomial time and approximation algorithms.•Extension to the case of a fixed number of unavailability pe...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 296; no. 2; pp. 423 - 439
Main Author:	Shabtay, Dvir
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.01.2022
Subjects:	Approximation algorithms Controllable processing time Machine unavailability period Pseudo polynomial time algorithm Resource allocation Single-machine scheduling Single-machine scheduling Approximation algorithms Pseudo polynomial time algorithm Machine unavailability period Controllable processing time Resource allocation
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!