Parallel-machine scheduling with controllable processing times
Authors:
- 1 February 1996
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 28 (2) , 177-180
Abstract
We consider a problem of scheduling nindependent and simultaneously available jobs on munrelated parallel machines. The job processing times can be compressed through incurring an additional cost, which is a convex function of the amount of compression. Two problems are formulated as assignment problems, which can be solved inO (n3m + n2m log(nm))time. One is to minimize the total compression cost plus the total flow time. The other is to minimize the total compression cost plus the sum of earliness and tardiness costs.Keywords
This publication has 12 references indexed in Scilit:
- Single-machine sequencing with controllable processing timesEuropean Journal of Operational Research, 1992
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due DateOperations Research, 1991
- A survey of results for sequencing problems with controllable processing timesDiscrete Applied Mathematics, 1990
- Sequencing with Earliness and Tardiness Penalties: A ReviewOperations Research, 1990
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs TardyOperations Research, 1989
- A two-machine flow shop scheduling problem with controllable job processing timesEuropean Journal of Operational Research, 1988
- Job-shop scheduling with resource-time models of operationsEuropean Journal of Operational Research, 1987
- A Generalized Uniform Processor SystemOperations Research, 1985
- A bicriterion approach to time/cost trade-offs in sequencingEuropean Journal of Operational Research, 1982
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling ProblemOperations Research, 1982