This paper considers a two-stage assembly flow shop scheduling problem. When all parts of each product are completed in the first stage, they are assembled into a final product on an assembly machine in the second stage. In order to reduce the delivery cost, completed products can be held until completion of some other products to be delivered in a same batch. The proposed problem addresses sch...

The Multi-objective Flexible Job Shop Scheduling (MFJSS) problem, in which the order or processing sequence for a set of jobs through several machines is assigned an optimal patterns have accepted sizeable attentiveness. Different types scheduling rules and procedures certain MFJSS made progress from these endeavors. problem cumbersome to be consistent due different criteria involved. This beca...

The garment industry in Vietnam is one of the country's strongest industries world. However, production process still encounters problems regarding scheduling that does not equate to an optimal process. paper introduces a solution resolves potential delays and lateness hinders using integer programming order allocation with make-to-order manufacturing viewpoint. A number constraints were consid...

To alleviate the range anxiety of drivers and time-consuming charging for electric buses (eBuses), opportunity fast-charging has gradually been utilized. Considering that eBuses have operational tasks, identifying an optimal scheduling will be needed. However, in real world, arrival time state charge (SOC) are uncertain. Therefore, it is challenging station to efficiently schedule tasks. solve ...

The task of job shop scheduling – determining the sequence and timing of jobs on available resources – is one of the most discussed practical problems in operations management. There are many appropriate problem definitions for job shop scheduling due to the complex and dynamic nature of the problem with a large number of variables and constraints linked to jobs and resources, such as specific ...

We study a scheduling problem that belongs to the yard operations component of the railroad planning problems, namely the hump sequencing problem. The scheduling problem is characterized as a single-machine problem with stepwise tardiness cost objectives. This is a new scheduling criterion which is also relevant in the context of traditional machine scheduling problems. We produce complexity re...

A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsibl...