Journal ArticleDOI
Time-optimal control in a single machine problem with resource constraints
TLDR
An algorithm of finding the time-optimal control of performance of jobs on a single machine with resource allocation, i.e. time-Optimal permutation of jobs with resource allocations is presented.About:
This article is published in Automatica.The article was published on 1986-11-01. It has received 60 citations till now. The article focuses on the topics: Resource allocation & Optimal control.read more
Citations
More filters
Journal ArticleDOI
A survey of scheduling with controllable processing times
Dvir Shabtay,George Steiner +1 more
TL;DR: This paper aims to give a unified framework for scheduling with controllable processing times by providing an up-to-date survey of the results in the field.
Journal ArticleDOI
Scheduling two agents with controllable processing times
TL;DR: NP-hardness proofs for the more general problems and polynomial-time algorithms for several special cases of the problems are provided.
Journal ArticleDOI
Single machine batch scheduling with resource dependent setup and processing times
TL;DR: Polynomial time algorithms are presented to find an optimal batch sequence and resource values such that either the total weighted resource consumption is minimized, subject to meeting job deadlines, or the maximum job lateness is minimized; subject to an upper bound on the total Weighted resource consumption.
Journal ArticleDOI
Single machine scheduling with a variable common due date and resource-dependent processing times
TL;DR: Algorithms with O(n2 log n) running times are presented for scheduling costs involving earliness/tardiness and number of tardy jobs and computational experiments show that the algorithms can solve problems with n= 5,000 in less than a minute on a standard PC.
Journal ArticleDOI
Single machine scheduling problem with a common deadline and resource dependent release dates
TL;DR: It is shown that the decision form of the problem dealt with is NP-complete in the strong sense for the case of identical release date reduction rates and some efficiently solvable cases and an approximate algorithm are shown.