Results 41 to 50 of about 22,962 (193)
Jurnal Teknik Industri, 2023 This research examined the scheduling of jobs with multiple stages unto identical parallel machines to minimize the makespan. The work is motivated by a Flexible Manufacturing System case that produces various parts and has multiple machining centers ...
Eka Pakpahan, Kenneth David Sumarna
doaj +1 more source
Scheduling optimization of optical lens polishing
International Transactions in Operational Research, EarlyView.Abstract Optical systems have achieved notable progress in focusing and imaging technologies; however, manual grinding remains indispensable, resulting in elevated costs, extended timelines, and inefficiencies. These difficulties are compounded by operational constraints, uneven machine utilization, and risks of order delays and escalating expenses ...
Tzu‐Chin Lin, Bertrand M. T. Lin
wiley +1 more source
Scheduling Monotone Moldable Jobs in Linear Time
, 2018 A moldable job is a job that can be executed on an arbitrary number of processors, and whose processing time depends on the number of processors allotted to it.
Jansen, Klaus, Land, Felix
core +1 more source
On (1,∊)-Restricted Assignment Makespan Minimization [PDF]
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014 Makespan minimization on unrelated machines is a classic problem in approximation algorithms. No polynomial time $(2- )$-approximation algorithm is known for the problem for constant $ > 0$. This is true even for certain special cases, most notably the restricted assignment problem where each job has the same load on any machine but can be ...
Chakrabarty, Deeparnab +2 more
openaire +1 more source
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
Non-Clairvoyant Batch Sets Scheduling: Fairness is Fair enough [PDF]
, 2006 Scheduling questions arise naturally in many different areas among which operating system design, compiling,... In real life systems, the characteristics of the jobs (such as release time and processing time) are usually unknown and unpredictable ...
Robert, Julien, Schabanel, Nicolas
core +1 more source
Multiobjective Task Scheduling in Cloud Environment Using Decision Tree Algorithm
IEEE Access, 2022 In recent years, Cloud computing has been developed and become the foundation of a wide range of applications. It allows users to access a catalog of standardized services and respond to their business needs flexibly and adaptively, in the event of ...
Hadeer Mahmoud +3 more
doaj +1 more source
International Transactions in Operational Research, Volume 33, Issue 3, Page 1525-1558, May 2026.Abstract In the last decade, explainability has been attracting much attention in the machine learning community. However, this research topic extends beyond this field to encompass others such as operations research and combinatorial optimization (CO).
Mathieu Lerouge +3 more
wiley +1 more source
Development and characterization of treated kaolin filled polypropylene/kaolin nanocomposites [PDF]
, 2018 This research work focused on producing modified kaolin filler in polypropylene/kaolin (PP/K) nanocomposite by melt compounding process in order to improve its mechanical and thermal properties for industrial applications.
Yahaya, Shehu
core
Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows [PDF]
, 2001 In this paper, the multi-mode resource constrained project scheduling problem with discounted cash flows is considered. The objective is the maximization of the net present value of all cash flows.
Sahin, Sule +5 more
core +1 more source