scholarly journals A TWO-STAGE GREEDY HEURISTIC FOR A FLOWSHOP SCHEDULING PROBLEM UNDER TIME-OF-USE ELECTRICITY TARIFFS

2018 ◽  
Author(s):  
Amir Ebrahimzadeh Pilerood ◽  
Mehdi Heydari ◽  
Mohammad Mahdavi Mazdeh
Keyword(s):  
Greedy Heuristic ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Two Stage ◽  
Flowshop Scheduling Problem

scholarly journals A Two-Stage Assembly-Type Flowshop Scheduling Problem for Minimizing Total Tardiness

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Ju-Yong Lee ◽  
June-Young Bang
Keyword(s):  
Lower Bounds ◽  
Branch And Bound ◽  
Total Tardiness ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Two Stage ◽  
Algorithm Performance ◽  
Second Stage ◽  
Flowshop Scheduling Problem ◽  
Dominance Properties

This research considers a two-stage assembly-type flowshop scheduling problem with the objective of minimizing the total tardiness. The first stage consists of two independent machines, and the second stage consists of a single machine. Two types of components are fabricated in the first stage, and then they are assembled in the second stage. Dominance properties and lower bounds are developed, and a branch and bound algorithm is presented that uses these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm. The algorithm performance is evaluated using a series of computational experiments on randomly generated instances and the results are reported.

A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM

2007 ◽  
Vol 24 (01) ◽  
pp. 45-56 ◽  
Author(s):  
LONGMIN HE ◽  
SHIJIE SUN ◽  
RUNZI LUO
Keyword(s):  
Processing Time ◽  
Parallel Machines ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Two Stage ◽  
Batch Processor ◽  
Flowshop Scheduling Problem ◽  
Stage 1

This paper considers a batch scheduling problem in a two-stage hybrid flowshop that consists of m dedicated parallel machines in stage 1 and a batch processor in stage 2. The processing time of a batch is defined as the largest processing time of the jobs contained in that batch. The criterion is to minimize the makespan, the time by which all operations of jobs have been processed. For such a problem, we present a polynomial time algorithm for the case with all jobs having the same processing time on the batch processor. An approximation algorithm with a competitive ratio 2 for the general case is also presented.

Sign in / Sign up

Export Citation Format

Share Document