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

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

This paper presents a new mathematical programming model for an integrated production and air transportation in supply chain management with sequence-dependent setup times in order to design an applied procedure for the production and distribution schedule. The aim of this model is to minimize the total supply chain cost consisting of the costs of distribution, production earliness and tardines...

This paper presents a new mathematical programming model for an integrated production and air transportation in supply chain management with sequence-dependent setup times in order to design an applied procedure for the production and distribution schedule. The aim of this model is to minimize the total supply chain cost consisting of the costs of distribution, production earliness and tardines...

Amiri, Nafiseh , Gholipour-Kanani, Yosouf , Tavakkoli-Moghaddam, Reza , Torabi, Seyed Ali ,

This paper proposes a novel, multi-objective integer programming model for an open-shop scheduling problem (OSSP). Three objectives are to minimize the makespan, total job tardiness and earliness, and total jobs setup cost. Due the complexity to solve such a hard problem, we develop a meta-heuristic algorithm based on multi-objective scatter search (MOSS), and a number of test problems are solv...

2015
Yihui Pan Tracy Yue Wang Michael S. Weisbach

Risk generated by uncertainty about future management policies appears to affect firms’ cost of borrowing. In a sample of S&P 1500 firms between 1987 and 2012, CDS spreads, loan spreads and bond yield spreads all decline over the first three years of CEO tenure, holding other macroeconomic, firm, and security level factors constant. This decline occurs regardless of the reason for the prior CEO...

2003
Anand Srinivasan James H. Anderson

In soft real-time applications, tasks are allowed to miss their deadlines. Thus, less-costly scheduling algorithms can be used at the price of occasional violations of timing constraints. This may be acceptable if reasonable tardiness bounds (i.e., bounds on the extent to which deadlines may be missed) can be guaranteed. In this paper, we consider soft real-time applications implemented on mult...

Journal: :Computers & Industrial Engineering 2006
Wojciech Bozejko Józef Grabowski Mieczyslaw Wodecki

Problem of scheduling on a single machine to minimize total weighted tardiness of jobs can be described as follows: there are n jobs to be processed, each job has an integer processing time, a weight and a due date. The objective is to minimize the total weighted tardiness of jobs. The problem belongs to the class of NP-hard problems. Some new properties of the problem associated with the block...

1999

This paper presents several local search meta-heuristics for the problem of scheduling a single machine to minimise total weighted tardiness. A genetic algorithm for the static single machine total weighted tardiness problem is presented, and a multi-start version named metaGA is proposed. The obtained computational results permit to conclude about their efficiency and effectiveness. The resolu...

2005
Jesús Trujillo Zbigniew J. Pasek Enrique Baeyens

The controls for reconfigurable manufacturing systems have to be capable not only of identifying exceptions on-line, but also simultaneously developing on-line strategies for unpredictable customer orders or inaccurate estimates of processing times. This paper presents an approach for job-shop scheduling with uncertain arrival times. The approach exploits Virtual Supervisor (VS) concept, which ...

2012
Zhengping Wu Burak Kazaz Scott Webster

I n this article, we study the newsvendor problem with endogenous setting of price and quoted lead-time. This problem can be observed in situations where a firm orders semi-finished product prior to the selling season and customizes the product in response to customer orders during the selling season. The total demand during the selling season and the lead-time required for customization are un...

2012
Stefano Fazi Tom van Woensel Jan C. Fransoo Tom Van Woensel

In this paper, we extend the classical Variable Size Bin Packing Problem (VS-BPP) by adding time features to both bins and items. Specifically, the bins act as machines that process the assigned batch of items with a fixed processing time. Hence, the items are available for processing at given times and are penalized for tardiness. Within this extension we also consider a stochastic variant, wh...

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

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