Results 111 to 120 of about 6,981,143 (177)

Single Machine and Parallel Machine Scheduling Problems with a Common Due Date to Minimize Total Weighted Tardiness

open access: yes, 2007
International audienceThis paper deals with a common due date parallel machines scheduling problem in which each job has a different tardiness penalty. The objective is to minimize the total weighted tardiness.
Tuong Nguyen, Huynh   +2 more
core  

Tightness of lead times [PDF]

open access: yes
This paper introduces a general, formal treatment of dynamic constraints, i.e., constraints on the state changes that are allowed in a given state space.
Kate, Hans A. ten
core  

Approximation algorithms for minimizing the total weighted tardiness on a single machine

open access: yes, 2006
Given a single machine and a set of jobs with due dates, the classical NP-hard problem of scheduling to minimize total tardiness is a well-understood one. Lawler gave a fully polynomial-time approximation scheme (FPTAS) for it some 20 years ago.
Steiner, G., Kolliopoulos, S.G.
core  

Home - About - Disclaimer - Privacy