Time-optimal control in a single machine problem with resource constraints
Automatica (Journal of IFAC)
Information Processing Letters
Sequencing with earliness and tardiness penalties: a review
Operations Research
A survey of results for sequencing problems with controllable processing times
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Mathematics of Operations Research
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
Discrete Applied Mathematics - Special issue on new frontiers in the theory and practice of combinatorial optimization: applications in manufacturing and VLSI design
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard
Information Processing Letters
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
SIAM Journal on Optimization
Single machine scheduling with a variable common due date and resource-dependent processing times
Computers and Operations Research
Computers and Operations Research
Minimizing the total weighted flow time in a single machine with controllable processing times
Computers and Operations Research
Pre-Emptive Scheduling Problems with Controllable Processing Times
Journal of Scheduling
Single machine scheduling with controllable release and processing parameters
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Multicriteria Scheduling: Theory, Models and Algorithms
Multicriteria Scheduling: Theory, Models and Algorithms
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Manufacturing & Service Operations Management
Hi-index | 0.00 |
We study a single-machine scheduling problem in a flexible framework where both job processing times and due dates are decision variables to be determined by the scheduler. The model can also be applied for quoting delivery times when some parts of the jobs may be outsourced. We analyze the problem for two due date assignment methods and a convex resource consumption function. For each due date assignment method, we provide a bicriteria analysis where the first criterion is to minimize the total weighted number of tardy jobs plus due date assignment cost, and the second criterion is to minimize total weighted resource consumption. We consider four different models for treating the two criteria. Although the problem of minimizing a single integrated objective function can be solved in polynomial time, we prove that the three bicriteria models are $\mathcal{NP}$ -hard for both due date assignment methods. We also present special cases, which frequently occur in practice, and in which all four models are polynomially solvable.