Job Block Scheduling with Dual Criteria and Sequence-Dependent Setup Time Involving Transportation Times

Gupta, Deepak; Nailwal, Kewal Krishan; Sharma, Sameer

doi:10.1007/978-81-322-1680-3_35

Cited by 2 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Gupta et al [25,26,27] formulated bi-criteria in flow shop for makespan and rental cost as objective under job-block and transportation involving sequence-dependent setup times. They considered the functioning of machines in flow shop to be continuous without considering the effect of break-down on the completion times of jobs.…”

Section: Introductionmentioning

confidence: 99%

A dual-criteria flow shop scheduling with sequence-dependent setup times

Nailwal

Gupta²,

Sharma

2015

Journal of Information and Optimization Sciences

Self Cite

View full text Add to dashboard Cite

Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs *on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

A dual-criteria flow shop scheduling with sequence-dependent setup times

Nailwal

Gupta²,

Sharma

2015

Journal of Information and Optimization Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the second class, the two criteria to be optimized forms the objective function. Gupta et al ( , 2012aGupta et al ( , 2013 formulated bi-criteria models belonging to first class for two stage flow shop with objective as minimization of makespan and rental cost with different parameters under the environment of sequence-dependent setup times. Mansouri et al (2009) considered two machine flow shop scheduling problem with sequence-dependent setup times using paretooptimality taking conflicting criteria as minimizing setups and makespan and it belongs to second group.…”

Section: Introductionmentioning

confidence: 99%

Multistage flow shop scheduling with bi-criteria objective using sequence dependent setup times

2019

El Sawah, S. (Ed.) MODSIM2019, 23rd International Congress on Modelling and Simulation.

View full text Add to dashboard Cite

In many industrial setups, setup time on machines during the processing of given jobs in flow shop has great impact on the objective considered; hence the setups need to be taken separately during the process. Two types of setups exist in flow shop scheduling problem namely sequence-independent and sequence-dependent setup times. Scheduling of jobs with sequence-dependent setup times in flow shop scheduling is the most complicated case in the theory of scheduling. The main concern in this paper is the sequence-dependent setup time in which the setup time depends on the job type to be done and just completed. In this paper, a heuristic algorithm for solving bi-criteria flow shop problem with sequencedependent setup times is proposed. The bi-criteria objective considered is the minimization of the operational cost of machines subject to minimum makespan in a flow shop whenever the setup times on machines are sequence-dependent. As the problem is NP-hard, the proposed heuristic algorithm finds the latest time at which the machines should start so as to reduce their operating time and hence the operational cost subject to minimum makespan. The problem discussed in the paper can easily be seen in the industrial setups where expensive machinery is in operation or it is difficult to start or stop the machines due to operations technical limitations. The proposed algorithm makes use of famous NEH algorithm with a new tie-breaking rule. The tie-breaking rule breaks the tie for sequences with equal makespan during the run of algorithm. The starting of machines at latest time reduces the operating time and hence the operational cost of machines. The proposed heuristic algorithm when applied to given set of data reduced the total operational cost of machines from 2166 units to 2040 units subject to minimum makespan 90 units thereby reducing the total cost of machines by 126 units. A numerical example is also given to substantiate the algorithm.

show abstract

Job Block Scheduling with Dual Criteria and Sequence-Dependent Setup Time Involving Transportation Times

Cited by 2 publications

References 15 publications

A dual-criteria flow shop scheduling with sequence-dependent setup times

A dual-criteria flow shop scheduling with sequence-dependent setup times

Multistage flow shop scheduling with bi-criteria objective using sequence dependent setup times

Contact Info

Product

Resources

About