Two parallel machine sequencing problems involving controllable job processing times

Alidaee, Bahram; Ahmadian, Ahmad

doi:10.1016/0377-2217(93)90245-i

Cited by 104 publications

(40 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors showed that the problem can be reduced to a linear assignment problem. Their results extended later by Alidace and Ahmadian (1993) to the parallel machine scheduling case. Biskup and Cheng (1999) also extended the work of Panwalkar and Rajagopalan (1992) by adding the total completion time in the objective function, and showed that the extended problem can be solved as an assignment problem.…”

Section: Introductionmentioning

confidence: 79%

“…The scheduling problem with controllable processing times and costs has been studied by researchers such as (Vickson 1980a, 1980b, Van Wassenhove and Baker 1982, Daniels and Sarin 1989, Zdrzalka 1991, Panwalkar and Rajagopalan 1992, Alidace and Ahmadian 1993, Guochun and Foulds 1998, Biskup and Cheng 1999, Foulds and Guochun 1999, Wan et al 2001, Hoogeveen and Woeginger 2002. Vickson (1980aVickson ( , 1980b initiates the topic, first, by considering the problem with the objective of minimizing the total flow time and the total processing cost incurred due to the job processing time compression (Vickson 1980a).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling with controllable processing times and compression costs using population-based heuristics

Nearchou

2010

International Journal of Production Research

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 79%

Section: Introductionmentioning

confidence: 99%

Scheduling with controllable processing times and compression costs using population-based heuristics

Nearchou

2010

International Journal of Production Research

View full text Add to dashboard Cite

“…Jobs Bahram Alidaee and Ahmad Ahmadian [80] have considered the problem of scheduling n single-operation jobs on 2 non-identical parallel machines where the sequencing of the jobs and their processing times are decision variables. In this research, the authors have assumed that the cost of processing a job is directly proportional to its processing time.…”

Section: Miscellaneous Problems With Non-preemptivementioning

confidence: 99%

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Panneerselvam¹,

Narayanan²

2010

IIM

View full text Add to dashboard Cite

This paper presents a survey of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. These parallel machines are also called proportional machines or related machines. There are several measures of performance which are to be optimized in uniform parallel machines scheduling. Since, this scheduling problem is a combinatorial problem; usage of a heuristic is inevitable to obtain solution in polynomial time. This paper gives a classification of the literatures of this scheduling problem in three major categories, viz. offline scheduling, online scheduling and miscellaneous scheduling. In total, the available literatures are classified into 17 subgroups. Under each of the first two categories, the available literatures are discussed under different groups based on different measures of performance and non-preemptive/preemptive nature of the jobs. In the last category, the literatures are discussed under three subgroups, namely non-preemptive jobs, preemptive jobs and periodic jobs.

show abstract

“…The problem Rm|p j = b j − u j |ΣC j + Σv j u j was considered in [1]. The authors showed that the problem may be formulated as an assignment problem and is solvable in O(n 3m + n 2 m log(nm)) time.…”

Section: Parallel Processorsmentioning

confidence: 99%

Resource Management in Machine Scheduling Problems: A Survey

Janiak

Lichtenstein

2007

dmms

View full text Add to dashboard Cite

Abstract. The paper is a survey devoted to job scheduling problems with resource allocation. We present the results available in the scientific literature for commonly used models of job processing times and job release dates, i.e., the models in which the job processing time or the job release date is given as a linear or convex function dependent on the amount of the additional resource allotted to the job. The scheduling models with resource dependent processing times or resource dependent release dates extend the classical scheduling models to reflect more precisely scheduling problems that appear in real life. Thus, in this paper we present the computational complexity results and solution algorithms that have been developed for this kind of problems.

show abstract

Two parallel machine sequencing problems involving controllable job processing times

Cited by 104 publications

References 11 publications

Scheduling with controllable processing times and compression costs using population-based heuristics

Scheduling with controllable processing times and compression costs using population-based heuristics

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Resource Management in Machine Scheduling Problems: A Survey

Contact Info

Product

Resources

About