نتایج جستجو برای: flowshop total tardiness time lags milp models valid inequalities

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

Journal: :Journal of the Operations Research Society of Japan 1996

2011
H. Georg Büsching

In this paper branching for attacking MILP is investigated. Under certain circumstances branches can be done concurrently. By introducing a new calculus it is shown there are restrictions for dual values. As a second result of this study a new class of cuts for MILP is found, which are defined by those values. This class is a superclass of all other classes of cuts. Furthermore the restrictions...

2006
Toni Jarimo Ahti Salo

In this paper, we consider the problem of partner selection in a virtual organisation (VO); specifically, we develop mixed integer linear programming (MILP) models to support the configuration of VOs in a virtual organisation breeding environment (VBE). Apart from the basic model which focuses on the minimisation of total fixed and variable costs we present extensions which capture transportati...

Journal: :European Journal of Operational Research 2022

The problem considered in this work consists scheduling a set of tasks on single machine, around an unrestrictive common due date to minimize the weighted sum earliness and tardiness. This can be formulated as compact mixed integer program (MIP). In article, we focus neighborhood-based dominance properties, where neighborhood is associated insert swap operations. We derive from these properties...

2004
Michele Pfund John W. Fowler Jatinder N. D. Gupta

This paper surveys the literature related to solving traditional unrelated parallel-machine scheduling problems. It compiles algorithms for the makespan, total weighted sum of completion times, maximum tardiness, total tardiness, total earliness and tardiness, and multiple criteria performance measures. The review of the existing algorithms is restricted to the deterministic problems without se...

2006
Toni Jarimo Ahti Salo

In this paper, we consider the problem of partner selection in a virtual organisation (VO); specifically, we develop mixed integer linear programming (MILP) models to support the configuration of VOs in a virtual organisation breeding environment (VBE). Apart from the basic model which focuses on the minimisation of total fixed and variable costs we present extensions that capture transportatio...

In this paper, three-stage assembly flowshop scheduling is considered with respect to minimizing bi-objectives, namely mean flow time and mean tardiness. This problem is a model of production systems, which several production operations are done simultaneously and independently, and then produced components are collected and transferred to an assembly stage for the final operation. In this mode...

2003
R. Montemanni L. M. Gambardella

In this paper we consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes of the network are connected and the total power consumption is minimized. A mixed integer programming formulation is presented together with some new valid reinforcing inequalities. Computational results show the effectiveness of the new valid inequalities ...

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

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