نتایج جستجو برای: apparent tardiness cost

تعداد نتایج: 495795  

2011
Sunita Gupta

Single machine, distinct due dates, early/lately machine problem and fuzzy environment closely models the situation faced by ‘Just In Time’ manufacturing. The objective of this paper is to sequence the jobs on the machine, so that the total penalty cost be minimum. This cost is composed of the total earliness and the total tardiness cost. An algorithm is developed here to minimize the total pen...

2001
Koji Nonobe Toshihide Ibaraki

As the resource constrained project scheduling problem (RCPSP) has a wide range of applications, its models, extensions and algorithms have been intensively studied [2]. As for objective functions, makespan minimization has commonly been used, while the importance of non-regular ones such as earliness-tardiness are also recognized. In this paper, we introduce a time-lag cost, which is charged a...

2009
F. Kianfar G. Mokhtari

In this paper, a simultaneous lead time quotation and lot sizing problem in an assembly system is investigated. We address a production system with a product that has deterministic demand over a T-period planning horizon and is produced in lots because of the economy of scale. If a lot is completed before the demand period, inventory carrying cost is incurred. On shortages, a lead time is quote...

2012
Ying Liu Niels Lohse Sanja Petrovic Nabil Gindy

Manufacturing enterprises nowadays face the challenge of increasing energy price and emission reduction requirements. An approach to reduce energy cost and become environmental friendly is to incorporate energy consumption into consideration while making the scheduling plans. The research presented by this paper is set in a classical job shop circumstance, the model for the triple objectives pr...

Journal: :Computers & Industrial Engineering 2013
Kuei-Tang Fang Bertrand M. T. Lin

0360-8352/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.cie.2012.10.002 q This manuscript was processed by Area Editor T.C ⇑ Corresponding author. Tel.: +886 3 5131472; fax: E-mail addresses: [email protected] (K.-T. Fan (B.M.T. Lin). Traditional research on machine scheduling focuses on job allocation and sequencing to optimize certain objective functions that are defin...

2001
E. KUTANOGLU I. SABUNCUOGLU

Meeting due dates as a re ̄ ection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today’s manufacturing environments. The natural quanti ® cation of this qualitative goal involves tardiness related measures. In this study, we consider the dynamic job shop scheduling problem with the weighted tardiness criterion. After we present a comprehensive liter...

Journal: :Journal of interpersonal violence 2007
Carol Reeves Anne M O'Leary-Kelly

This study examines the productivity-related effects and costs of intimate partner violence (IPV) on the workplace. Specifically, it explores whether IPV victims and nonvictims differ in the number of work hours missed due to absenteeism, tardiness, and work distraction and the costs for employers from these missed work hours. The research involved a Web-based survey of 823 male and 1,550 femal...

1998
D - H Lee Y - D Kim

We consider a multi-period order selection problem in ̄exible manufacturing systems, which is the problem of selecting orders to be produced in each period during the upcoming planning horizon with the objective of minimising earliness and tardiness costs and subcontracting costs. The earliness and tardiness costs are incurred if an order is not ®nished on time, while subcontracting cost is incu...

2008
Philippe Baptiste Ruslan Sadykov

We study the scheduling situation in which a set of jobs subjected to release dates and deadlines are to be performed on a single machine. The objective is to minimize a piecewise linear objective function ∑ j Fj where Fj(Cj) corresponds to the cost of the completion of job j at time Cj . This class of function is very large and thus interesting both from a theoretical and practical point of vi...

Journal: :Perform. Eval. 2017
Eliran Sherzer Yoav Kerner

We consider a queueing facility where customers decide when to arrive. All customers have the same desired arrival time (w.l.o.g. time zero). There is one server, and the service times are independent and exponentially distributed. The total number of customers that demand service is random, and follows the Poisson distribution. Each customer wishes to minimize the sum of three costs: earliness...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید