Opened 3 years ago

Last modified 9 months ago

#2161 accepted feature request

Implement the Permutation Flowshop Scheduling Problem

Reported by: abeham Owned by: rlongodo
Priority: medium Milestone: HeuristicLab 3.3.x Backlog
Component: ### Undefined ### Version: branch
Keywords: Cc:

Description

In the flow shop the assignment of each operation to each machine is the same for all jobs. So in each job operation 1 is done on the first machine, operation 2 on the second machine and so on. Each operation requires a certain processing time. The goal is to find an initial ranking of jobs that would minimize either the makespan or the total flow time. Makespan describes the time when the last job is done. Total flow time is the sum of the completion times of all jobs.

Change History (3)

comment:1 Changed 9 months ago by abeham

  • Owner changed from swagner to rlongodo
  • Status changed from new to assigned
  • Version changed from 3.3.9 to branch

comment:2 Changed 9 months ago by rlongodo

  • Status changed from assigned to accepted

comment:3 Changed 9 months ago by rlongodo

r14020: first commit of branch

Note: See TracTickets for help on using tickets.