Two parallel machine sequencing problems involving controllable job processing times
Authors:
- Bahram AlidaeeBABahram Alidaee
- Ahmad AhmadianAAAhmad Ahmadian
- 12 November 1993
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 70 (3) , 335-341
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Single-machine sequencing with controllable processing timesEuropean Journal of Operational Research, 1992
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysisOperations Research Letters, 1991
- A survey of results for sequencing problems with controllable processing timesDiscrete Applied Mathematics, 1990
- A two-machine flow shop scheduling problem with controllable job processing timesEuropean Journal of Operational Research, 1988
- The Factored Transportation ProblemManagement Science, 1984
- Solution structures and sensitivity of special assignment problemsComputers & Operations Research, 1984
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single MachineOperations Research, 1980
- Two Single Machine Sequencing Problems Involving Controllable Job Processing TimesA I I E Transactions, 1980
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969