31 research outputs found
Simultaneous minimization of total completion time and total deviation of job completion times
No full textMinimizing total completion time and total deviation of job completion times from a restrictive due-date
No full textScheduling with job-rejection and position-dependent processing times on proportionate flowshops
No full textWe study the classical scheduling problem of minimizing makespan on a proportionate flowshop. Position-dependent job processing times in the most general way are considered. We introduce a polynomial time solution procedure which is more efficient than the one known in the literature. The problem is further extended to allow job-rejection. This more general version is shown to be solved in polynomial time as well
A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
No full textA note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
No full text
Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job"
No full text
