Year: 2025
Type: article
Abstract: Scheduling problems, a core area in operations research and computer science, involve optimizing the allocation of resources over time to complete a set of tasks or jobs, often subject to various constraints. These problems arise in diverse real-world scenarios, from manufacturing-ing and project management to resource allocation in computing systems. The core objective is to find the best schedule that minimizes or maximizes a specific performance measure, such as makespan (total time to complete all tasks), total completion time, or total tardi-ness. Formalization of scheduling problems is very often mathematically and directly bound to a solving method. It allows one to use the properties of the problem to face the complexity of its resolution. The present work deals with sequencing problems for ‘n’ jobs on two machines and ‘n’ jobs on m machines. A new metaheuristic algorithm is provided for obtaining an optimal sequence, for determining the minimum duration of the makespan, and also for finding the minimum idle time of the given machines.
DOI: 10.14419/s6trda64
Authors: Anishabun Khyllemkharai, Roselin Antony
Institution: Sam Higginbottom Institute of Agriculture
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4416827420
FWCI:
Cites:
Cited by:
Related to: