Results 31 to 40 of about 6,981,143 (177)

Penerapan Algoritma Viral System pada Single-Machine Total Weighted Tardiness Problem

Jurnal Teknik ITS, 2012
Single Machine Total Weighted Tardiness Problem (SMTWTP) merupakan permasalahan klasik kombinatorial yang dikenal np-hard. Pada penelitian ini, suatu algoritma yang relatif baru yang terinspirasi dari sistem replikasi virus yang disebut sebagai Viral ...
Umar Affandi, Budi Santosa
doaj  

Due-Window Assignment and Resource Allocation Scheduling with Truncated Learning Effect and Position-Dependent Weights

Discrete Dynamics in Nature and Society, 2020
This paper studies single-machine due-window assignment scheduling problems with truncated learning effect and resource allocation simultaneously. Linear and convex resource allocation functions under common due-window (CONW) assignment are considered ...
Shan-Shan Lin
doaj   +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, Antônio A. Chaves, Mauricio G. C. Resende, Silvio A. de Araujo   +3 more
wiley   +1 more source

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions [PDF]

, 2012
This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new
Haouari, Mohamed, Kacem, Imed, Imed Kacem, Souayah, Nizar, Mohamed Haouari, Nizar Souayah   +5 more
core   +1 more source

New Ideas in Lagrangian Relaxation for a Scheduling Problem with the weighted Tardiness Criterion

International Journal of Applied Mathematics and Computer Science
We consider an extension of Lagrangian relaxation methods for solving the total weighted tardiness scheduling problem on a single machine. First, we investigate a straightforward relaxation method and decompose it into upper and lower subproblems.
Rudy Jarosław, Idzikowski Radosław, Smutnicki Czesław, Banaszak Zbigniew, Bocewicz Grzegorz   +4 more
doaj   +1 more source

Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents

The Scientific World Journal, 2014
We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-
Wen-Chiung Lee, Yau-Ren Shiau, Yu-Hsiang Chung, Lawson Ding   +3 more
doaj   +1 more source

ACCURATE TOTAL WEIGHTED TARDINESS MINIMIZATION IN TIGHT-TARDY PROGRESSIVE SINGLE MACHINE SCHEDULING WITH PREEMPTIONS BY NO IDLE PERIODS

KPI Science News, 2019
Background. The problem of minimization of total weighted tardiness can be solved either exactly by the corresponding models or heuristically. As of October 2019, nearly the best heuristic is one based on using remaining available and processing periods.
Vadim V. Romanuke
doaj   +1 more source

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

Nanofiber PVA‐Based Membranes Incorporating Functionalized Spanish Broom Derivatives for Sustainable Water Purification

ENERGY &ENVIRONMENTAL MATERIALS, Volume 9, Issue 6, November 2026.
This study investigates Spanish broom (Spartium junceum) as a renewable source for electrospun composite membranes in sustainable water purification. MCC and biochar were functionalized with eco‐friendly precursors and nanomaterials (i.e., HNT, β‐CDs) to develop hybrid PVA nanofiber composites.
Giulia Rando, Silvia Sfameni, Jozefien Geltmeyer, Alessandra Palella, Lorenzo Spadaro, Alberto Riminucci, Karen De Clerck, Maria Rosaria Plutino   +7 more
wiley   +1 more source

Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem

International Journal of Industrial Engineering and Production Research, 2010
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date.
Mohammad Mahdavi Mazdeh, Ali Khan Nakhjavani, Abalfazl Zareei   +2 more
doaj   +2 more sources