Results 111 to 120 of about 9,841 (196)
Metaheuristics for Order Batching and Sequencing in Manual Order Picking Systems [PDF]
Order picking deals with the retrieval of articles from their storage locations in order to satisfy customer requests. A major issue in manual order picking systems concerns of the transformation and consolidation of customer orders into picking orders ...
Verena Schmid, Sebastian Henn
core
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
, 2009 This paper studies the flowshop scheduling problem with a complex bicriteria objective function. A weighted sum of makespan and maximum tardiness subject to a maximum tardiness threshold value is to be optimized.
Ruiz, Rubén, Allahverdi, ALİ
core +1 more source
How fragile is the routing time window of delivery systems against spatial distributional uncertainty? We study the tardiness risk of Traveling Salesman Problem (TSP) solutions with respect to a service deadline (target) over the routing time.
Haoyue Liu, Sheng Liu
core +1 more source
Tardiness of Attorneys as Contempt of Court [PDF]
, 1970 Tardiness of an attorney is a violation of the Cannons of Professional Ethics. A continual disregard of the canons of ethics constitutes misconduct or moral turpitude. Misconduct or moral turpitude are grounds for disbarment.
Esper, Thomas L.
core
Correlation among tardiness-based measures for scheduling using priority dispatching rules
, 2013 International audienceOne of the most used methods to schedule manufacturing systems is to use priority dispatching rules (pdrs). It is frequently desired to distinguish the behavior of pdrs in regards with tardiness based performance measures.
Shahzad, Atif, +2 more
core +1 more source
Applied SciencesThis research deals with the parallel machine scheduling problem for identical machines that need additional operational resources during the changeover. The production strategy is mainly based on make-to-stock.
Yiyo Kuo, Dong-Xuan Li
doaj +1 more source
Lagrangian relaxation algorithms for hybrid flow-shop with earliness/tardiness scheduling problems
, 2014 This paper considers the characteristics of a hybrid flow shop with JIT technical constraints. Lagrangian relaxation is presented to solve the Earliness/Tardiness problem in the hybrid flow-shop.
Li D(李冬) +3 more
core
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2017 Scheduling problems have been treated as single criterion problems until recently. Many of these problems are computationally hard to solve three as single criterion problems.
H. F Abdullah
doaj
, 2011 The earliness/tardiness (E/T) case of Hybrid Flow-shop Scheduling problem (HFSP) is an NP hard problem, which is difficult to deal with, however, the local assignment existing in the practical production increases the complexity of this problem.
Han ZH(韩忠华) +3 more
core
Minimizing the Total Completion Times, the Total Tardiness and the Maximum Tardiness
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2017 In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem.
Tariq S. Abdul-Razaq, Zainab M. Ali
doaj