Prakarn Unachak

  • Citations Per Year
Learn More
The flexible job-shop scheduling problem (FJSP) is one of the most popular scheduling problems, due to its relative simplicity, compared to real-world scheduling problems, and its NP-hardness. There are two types of decisions involved in solving FJSP problems: (1) assigning machines to operations, or routing, and (2) assigning a time slot in the assigned(More)
In this paper, we present an alternative representation for solving multiobjective Flexible Job-shop Scheduling Problems (FJSP). In FJSP, there may be a choice of machines that can perform any given operation. In order to schedule an operation, it needs to be assigned a machine first, a process known as routing. Most previous approaches to solving FJSP(More)
  • 1