This paper investigates the use of genetic programming in automatized synthesis of heuristics for the parallel unrelated machines environment with arbitrary performance criteria. The proposed scheduling heuristic consists of a manually defined meta-algorithm which uses a priority function evolved separately with genetic programming. In this paper, several different genetic programming methods f...

this research, for the first time presents the flexible flow shop model of scheduling method for considering runway assignment and operations planning together. one of the advantages of the developed model is considering the procedures of air routes in terminal airspace and separation between consecutive aircraft which is very similar to the real world condition. there are different objective f...

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

Although dynamic programming could ideally solve any combinatorial optimization problem, the curse of dimensionality of the search space seriously limits its application to large optimization problems. For example, only few papers in the literature have reported the application of dynamic programming to workforce scheduling problems. This paper investigates approximate dynamic programming to ta...

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...

heuristics have been proposed for scheduling pipelined code, all assume, however, that pipeline constraints can occur after any instruction, and that operators. proaches are generally slower but more flexible than their heuristic couninstruction scheduling, since their dynamic reordering algorithms have limited scope. Optimierungsprobleme, Instruction Scheduling und Offset Assignment, when usin...

Dynamic lotsizing and scheduling on multiple lines to meet the customer due dates is significant in multi-line production environments. Therefore, this study investigates dynamic problems flexible machining considering mixed products. In addition, uncertainty demand machine failure considered. A mathematical model proposed for considered problem with an aim maximize probability of completion pr...

in this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. single supplier via a flexible flow line production system (ffl) produces several items and delivers them directly to an assembly facility. based on basic period (bp) strategy, a new mixed zero-one nonlinear programming model has been develope...