نتایج جستجو برای: earliness

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

2007
Jan Kelbel Zdeněk Hanzálek

This paper describes a constraint programming approach to solving a scheduling problem with earliness and tardiness cost using a problem specific search procedure. The presented algorithm is tested on a set of randomly generated instances of the job shop scheduling problem with earliness and tardiness costs. The experiments are executed also for three other algorithms, and the results are then ...

Journal: :Robotics and Autonomous Systems 2015
Hamed Fazlollahtabar Mohammad Saidi-Mehrabad Jaydeep Balakrishnan

In this paper, a scheduling problem for multiple automated guided vehicles (AGVs) in a manufacturing system is proposed and formulated. Considering the due date of AGVs requiring for material handling among shops in a jobshop layout, their earliness and tardiness are significant in satisfying the expected cycle time and from an economic view point. Earliness results in AGVs waiting and tardines...

2009
Pavithra Parthasarathi Anupam Srivastava Nikolas Geroliminis David Levinson

Abstract This research quantifies the relationship between the cost of earliness and lateness by empirically observing commute trips from two different sources. The first empirical analysis uses individual level travel survey data from six metropolitan regions while the second analysis uses traffic data from the Twin Cities freeway network. The analysis conducted in this research provides a met...

Journal: :Applied Mathematics and Computer Science 2013
Adam Janiak Tomasz Kwiatkowski Maciej Lichtenstein

In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this...

Journal: :Annals OR 2008
Dvir Shabtay George Steiner

We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomialtime algorithm to find the optimal job sequence, due date values and resource allocation minim...

Journal: :Computers & OR 1993
Parthasarati Dileepan

This paper considers the problem of linding an optimal schedule and a common due date for a set of jobs, in a static single machine system. The scheduling criterion is the minimization of the weighted sum of earliness and tardiness values. Different weights are considered as the earliness penalty and tardiness penalty, for each job. A branching procedure is presented for finding an optimal solu...

Journal: :Int. J. Computational Intelligence Systems 2013
Andreas C. Nearchou Sotiris L. Omirou

Focusing on the just-in-time (JIT) operations management, earliness as well as, tardiness of jobs’ production and delivery should be discouraged. In accordance to this philosophy, scheduling problems involving earliness and tardiness penalties are very critical for the operations manager. In this paper, a new population heuristic based on the particle swarm optimization (PSO) technique is prese...

Journal: :European Journal of Operational Research 2008
Jeffrey E. Schaller Jatinder N. D. Gupta

This paper considers the problem of scheduling a given number of jobs on a single machine to minimize total earliness and tardiness when family setup times exist. The paper proposes optimal branch-and-bound algorithms for both the group technology assumption and if the group technology assumption is removed. A heuristic algorithm is proposed to solve larger problems with the group technology as...

Journal: :Journal of experimental botany 2007
Asun Fernández-Del-Carmen Carolina Celis-Gamboa Richard G F Visser Christian W B Bachem

A combination of cDNA-amplified fragment length polymorphism (AFLP) and bulked segregant analysis (BSA) was used to identify genes co-segregating with earliness of tuberization in a diploid potato population. This approach identified 37 transcript-derived fragments with a polymorphic segregation pattern between early and late tuberizing bulks. Most of the identified transcripts mapped to chromo...

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

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