An Improved Marriage in Honey-Bee Optimization Algorithm for Minimizing Earliness/Tardiness Penalties in Single-Machine Scheduling with a Restrictive Common Due Date by Pedro Palominos, Mauricio Mazo, Guillermo Fuertes, Miguel Alfaro

“…This study evaluates the efficiency of a swarm intelligence algorithm called marriage in honey-bee optimization (MBO) in solving the single-machine weighted earliness/tardiness problem, a type of NP-hard combinatorial optimization problem. …”
Get full text

Integrating Order Splitting and Acceptance with Batch Delivery in Parallel Machine Scheduling by Hanxing Cui, Qilan Zhao, Huanhuan Wang, Yuliang Guo, Junjie Guo

Subjects: Get full text

Neighbourhood search-based metaheuristics for the bi-objective Pareto optimization of total weighted earliness-tardiness and makespan in a JIT single machine scheduling problem by Sona Babu, B.S. Girish

Subjects: “…Total weighted earliness and tardiness…”
Get full text

A Mixed Integer Linear Formulation and a Grouping League Championship Algorithm for a Multiperiod-Multitrip Order Picking System with Product Replenishment to Minimize Total Tardiness by Morteza Farhadi Sartangi, Ali Husseinzadeh Kashan, Hassan Haleh, Abolfazl Kazemi

“…In this paper, we consider an order picking problem, in which a number of orders with different delivery due dates are going to be retrieved by a limited number of order pickers in multiperiods such that the total tardiness is minimized. The aim is to determine a retrieval plan in terms of order batching and order picker multitrip routing as decision variables. …”
Get full text

Dilemmi educativi, attorialità non professionista e divismo infantile nel cinema italiano postbellico: il caso di Domani è troppo tardi (1950) di Léonide Moguy by Diletta Pavesi

“…Produced by Rizzoli Film in collaboration with Giuseppe Amato and directed by French-Russian film maker Léonide Moguy, Domani è troppo tardi (1950) is an interesting example of contamination between “melodramatic imagination” and the poetics of Italian Neorealism. …”

Development of Dispatching Rule based Heuristic Algorithms for Real-Time Dynamic Scheduling of Non-identical Parallel Burn-in Ovens with Machine Eligibility Restriction by Dhaval Pujara, M. Mathirajan

Subjects: Get full text

Electric Vehicle Routing with Time Windows and Charging Stations from the Perspective of Customer Satisfaction by Yasin Ünal, İnci Sarıçiçek, Sinem Bozkurt Keser, Ahmet Yazıcı

Subjects: Get full text

Z.A. Brzozowska, M.J. Leszka, T. Wolińska (eds.), Muhammad and the Origin of Islam in the Byzantine-Slavic Literary Context. A Bibliographical History, transl. by K. Gucio and K. Szuster-Tardi, Jagiellonian University Press, Łódź 2020 (= Byzantina Lodziensia), pp. 384 by Marcello Garzaniti

Get full text

Addressing Due Date and Storage Restrictions in the S-Graph Scheduling Framework by Krisztián Attila Bakon, Tibor Holczinger

Subjects: Get full text

Strong NP-hardness of two-machine flow-shop scheduling with periodic due dates(具有等间隔工期的2台机器流水作业调度问题的强NP难性) by 崔晓龙(CUI Xiaolong), 何周力(HE Zhouli), 梅嘉杰(MEI Jiajie), 万龙(WAN Long)

Subjects: Get full text

Bulanık Bozulma ve Öğrenme Etkileri Altında Tek Makine Erken/Geç Tamamlanma Probleminin Bulanık Şans Kısıtlı Programlama Tekniği ile İncelenmesi by Oğuzhan Ahmet Arık, Mehmet Duran Toksarı

Subjects: Get full text

Remote Assessment of Platelet Function in Patients with Acute Stroke or Transient Ischaemic Attack by Philip M. Bath, Jane May, Katie Flaherty, Lisa J. Woodhouse, Natalia Dovlatova, Sue C. Fox, Timothy J. England, Kailash Krishnan, Thompson G. Robinson, Nikola Sprigg, Stan Heptinstall, TARDIS Investigators

“…Background. The TARDIS trial assessed the safety and efficacy of intensive versus guideline antiplatelet agents given for one month in patients with acute stroke or TIA. …”
Get full text

Introducing STARDIS: An Open and Modular Stellar Spectral Synthesis Code by Joshua V. Shields, Wolfgang Kerzendorf, Isaac G. Smith, Tiago M. D. Pereira, Christian Vogl, Ryan Groneck, Andrew G. Fullard, Jaladh Singhal, Jing Lu, Christopher J. Fontes

“…We find that stardis generally agrees with korg for solar models on the few-percent level or better, though the codes can diverge in the UV, with more extreme differences in cooler stars. stardis can be found at https://github.com/tardis-sn/stardis , and documentation can be found at https://tardis-sn.github.io/stardis/ .…”
Get full text

Single-Machine Scheduling with Upper Bounded Maintenance Time under the Deteriorating Effect by Pengfei Xue, Yulin Zhang

“…If the actual processing time of a job exceeds the upper bound, tardiness penalty of the job should be paid. And if the maintenance time exceeds the corresponding upper bound, tardiness penalty of the maintenance should also be paid. …”
Get full text

Dynamic Scheduling in Identical Parallel-Machine Environments: A Multi-Purpose Intelligent Utility Approach by Mahmut İbrahim Ulucak, Hadi Gökçen

“…It effectively minimizes total weighted tardiness and the number of tardy jobs while maintaining key performance metrics like stability, robustness, and nervousness. …”
Get full text

Techniques of Finding Lower Bounds in Multi Objective Functions by Ayad Ramadhan, Adil Jabbar

“…In this paper, the problm of sequencing n jobs on one machine is considered with a multi objective function.Two problems have been studied, sum of completion times added with the maximum tardiness () and sum of completion times with the maximum tardiness (), the first one has optimal solution solved by Branch and bound technique, the second has efficient solutions founded by Van Wassenhove algorithm.A theorem is presented to show a relation between the number of efficient solutions, lower bound (LB) and optimal solution.This theorem restricts the range of the lower bound, which is the main factor to find the optimal solution.Also the theorem opens algebraic operations and concepts to find new lower bounds. …”
Get full text

Comparative Analysis of Dedicated and Randomized Storage Policies in Warehouse Efficiency Optimization by Rana M. Saleh, Tamer F. Abdelmaguid

“…Conversely, results from large-size instances indicate that D-SLAP surpasses R-SLAP in optimizing waiting time and tardiness objectives, while R-SLAP achieves lower transportation cost.…”
Get full text

Vehicle Routing and Scheduling Problem for a multi-period, multi-perishable product system with time window: A Case study by Alireza Rashidi Komijan, Danial Delavari

“…In the objective function, the costs of transportation, holding, tardiness and earliness are considered simultaneously. …”
Get full text

Proactive Production Scheduling Approach for Off-Site Construction with Due Date Uncertainty by Taehoon Kim, Yong-Woo Kim

“…The experimental study shows that the proposed model can find the best schedule with 303.8 h of tardiness at a 100% confidence level, followed by NEHedd 324.7 h, basic GA 328.5 h, and EDD 335.8 h. …”
Get full text

Operating theatre time utilisation and elective surgery cancellations: A one-month review in a Nigerian teaching hospital by Emem Akpanudo, Monday A. Ituen, Victory E. Iyanam

“…Methods A prospective cross-sectional study was conducted to analyse observational data from OT processes, including first-case tardiness, prediction bias, turnover time, cancellations, and raw utilisation. …”
Get full text