A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs

Article Abstract:

Research investigating the performance of dispatching rules and developing a heuristic for scheduling two types of flowshops operations is presented, namely the ones with missing and the ones with no operations of jobs. A heuristic minimizing the total flow time of jobs is developed.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs

Article Abstract:

A heuristic algorithm is proposed to consider the scheduling problem in a flowshop and to reduce the total weighted flowtime of jobs. The proposed heuristic is developed by introducing lower bounds on the completion times of jobs and developing heuristic preference relations for the scheduling problem. The heuristic algorithm is better than conventional heuristics in providing solution quality. It can produce good solutions even without improvement scheme through a negligible CPU time.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

A comparative study of dispatching rules in dynamic flowshops and jobshops

Article Abstract:

A simulation study on the issue of scheduling in dynamic jobshops was conducted to investigate dispatching methods in two sets of manufacturing systems, namely, dynamic flowshops/jobshops and dynamic flowshops with missing operations on some machines/jobshops. Three new dispatching rules are proposed. Results of the study reveal some interesting observations on the performance of dispatching rules in these two types of manufacturing systems.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: