Leveraging constraint-based approaches for multi-objective flexible flow-shop scheduling with energy costs (original) (raw)
2016, Intelligenza Artificiale
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Related papers
Mathematics and Computers in Simulation, 2021
We propose an enhanced multi-objective harmony search (EMOHS) algorithm and a Gaussian mutation to solve the flexible flow shop scheduling problems with sequence-based setup time, transportation time, and probable rework. A constructive heuristic is used to generate the initial solution, and clustering is applied to improve the solution. The proposed algorithm uses response surface methodology to minimize both maximum completion time and mean tardiness, concurrently. We evaluate the efficacy of the proposed algorithm using computational experiments based on five measures of diversity metric, simultaneous rate of achievement for two objectives, mean ideal distance, quality metric, and coverage. The experimental results demonstrate the effectiveness of the proposed EMOHS compared with the existing algorithms for solving multi-objective problems. c
Robust multi-objective hybrid flow shop scheduling
2021
Scheduling is an important decision-making process that aims to allocate limited resources to the jobs in a production process. Among scheduling problems, Hybrid Flow Shop (HFS) scheduling has good adaptability with most real world applications including innumerable cases of uncertainty of parameters that would influence jobs processing when the schedule is executed. Thus a suitable scheduling model should take parameters uncertainty into account. The present study develops a multi-objective Robust Mixed-Integer Linear Programming (RMILP) model to accommodate the problem with the real-world conditions in which due date and processing time are assumed uncertain. The developed model is able to assign a set of jobs to available machines in order to obtain the best trade-off between two objectives including total tardiness and makespan under uncertain parameters. Fuzzy Goal Programming (FGP) is applied to solve this multi objective problem. Finally, to study and validate the efficiency ...
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.