Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraints

HIGHLIGHTS

  • who: Mohamed Ali Rakrouki from the Applied College, Taibah University, Saudi Arabia have published the research: Minimizing Total Tardiness in a Two-Machine Flowshop Scheduling Problem with Availability Constraints, in the Journal: (JOURNAL)
  • what: The authors develop five metaheuristics for the problem under consideration. The aim of this step is to move the colonies of an empire toward the imperialist.
  • how: Let r be a partial sequence of scheduled jobs and J be the set of unscheduled jobs this procedure can be described as follows Algorithm 1.

SUMMARY

    Ghassemi . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?