Journal ArticleDOI
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard
Reads0
Chats0
TLDR
A positive answer to this conjecture is given, showing that this problem to minimize total compression plus weighted flow cost is NP-hard.About:
This article is published in Information Processing Letters.The article was published on 2001-09-30. It has received 35 citations till now. The article focuses on the topics: Function problem & Single-machine scheduling.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
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
Dvir Shabtay,George Steiner +1 more
TL;DR: This paper analyzes the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times with a polynomial-time algorithm for each combination of methods to find the optimal job sequence, due date values and resource allocation.
Journal ArticleDOI
Single-machine scheduling with learning effect and resource-dependent processing times
TL;DR: This work considers resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation, and provides a polynomial time algorithm to find the optimal job sequence and resource allocation.
Journal ArticleDOI
Parallel machine scheduling problem to minimize the makespan with resource dependent processing times
TL;DR: By examining 10,000 randomly generated instances, the proposed simulated annealing algorithm shows an excellent performance in not only the solution quality but also the computation time.
References
More filters
Journal ArticleDOI
One-processor scheduling with symmetric earliness and tardiness penalties
TL;DR: It is shown that the problem of finding minimum cost schedules is NP-complete; however, an efficient algorithm is given that finds minimum cost scheduling whenever the tasks either all have the same length or are required to be executed in a given fixed sequence.
Journal ArticleDOI
Two Single Machine Sequencing Problems Involving Controllable Job Processing Times
TL;DR: This paper presents simple methods for solving two single machine sequencing problems when job processing times are themselves decision variables having their own associated linearly varying costs.
Journal ArticleDOI
Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
TL;DR: The heuristic solutions are compared with optimal solutions obtained by branch and bound in numerous randomly generated problems and are found to be optimal in most cases.
Journal ArticleDOI
A survey of results for sequencing problems with controllable processing times
TL;DR: In the paper, an attention is focussed on the computational complexity aspects, polynomial algorithms and the worst-case analysis of approximation algorithms.