Results 61 to 70 of about 6,554,898 (191)
Ibn Al-Haitham Journal for Pure and Applied SciencesMachine scheduling problems (MSP) are considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and ...
Bayda Atiya kalaf +2 more
doaj +1 more source
A unified formulation for home healthcare routing and scheduling problems
International Transactions in Operational Research, EarlyView.Abstract Home Healthcare is an essential component of healthcare systems, where caregivers visit patients' homes to deliver services. While presenting advantages with respect to institutional care, such as being cost‐effective and alleviating family burdens, it presents challenges in scheduling and routing caregivers efficiently.
Sara Ceschia +7 more
wiley +1 more source
A Novel Hybrid Algorithm for Minimizing Total Weighted Tardiness Cost [PDF]
Computer Science Journal of Moldova, 2019 In this research paper, we aim to present a hybrid algorithm in order to obtain a better solution to the single machine total weighted tardiness scheduling problem (SMTWT).
Lamiche Chaabane
doaj
Efficient exact formulations for the flexible job shop scheduling with flexible maintenance
International Transactions in Operational Research, EarlyView.Abstract In modern manufacturing systems, integrating preventive maintenance into production scheduling is essential to ensure operational efficiency and equipment reliability. This paper addresses the flexible job shop scheduling problem under machine unavailability constraints caused by non‐fixed maintenance tasks.
Tom Perroux +4 more
wiley +1 more source
Bicriteria scheduling for due date assignment with total weighted tardiness [PDF]
, 2018 In the due date assignment, the bicriteria scheduling models are motivated by the trade-off between the due date assignment cost and a performance criterion of the scheduling system.
Yixun Lin +5 more
core +1 more source
The one‐dimensional cutting stock problem with sequence‐dependent setups
International Transactions in Operational Research, EarlyView.Abstract The cutting stock problem (CSP) is a classic operations research problem with several applications in real‐world scenarios. It involves cutting large objects into smaller items to satisfy customer demands, minimizing the number of cut objects.
Eduardo M. Silva +3 more
wiley +1 more source
Permutation Flowshop Scheduling with Earliness and Tardiness Penalties [PDF]
We address the permutation flowshop scheduling problem with earliness and tardiness penalties (E/T) and common due date of jobs. Large number of process and discrete parts industries follow flowshop type of production process.
Peeyush Mehta +2 more
core
Impacts of Edge AI/agentic AI on supply chain management and operations research
International Transactions in Operational Research, EarlyView.Abstract Edge AI refers to the deployment and execution of artificial intelligence (AI) algorithms on decentralized, local computing devices (e.g., Internet of Things) rather than relying on centralized cloud‐based computing infrastructures. The literature has addressed the increasing importance of AI in supply chain and operations management (SCOM ...
Dmitry Ivanov
wiley +1 more source
Beam search heuristics for quadratic earliness and tardiness scheduling [PDF]
In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. These heuristics include classic beam search procedures, as well as filtered and recovering
Jorge M. S. Valente
core
A rescheduling heuristic for the single machine total tardiness problem [PDF]
, 2016 In this paper, we propose a rescheduling heuristic for scheduling N jobs on a single machine in order to minimise total tardiness. The heuristic is of the interchange type and constructs a schedule from the modified due date (MDD) schedule.
Nyirenda, J C
core +1 more source