Showing 1 - 10 of 46
Persistent link: https://www.econbiz.de/10008164158
In a recent paper, Chen and Ji [Chen, K., Ji, P., 2007. A mixed integer programming model for advanced planning and scheduling (APS). European Journal of Operational Research 181, 515-522] develop a mixed integer programming model for advanced planning and scheduling problem that considers...
Persistent link: https://www.econbiz.de/10008483217
Persistent link: https://www.econbiz.de/10008349076
In this article, we present a mathematical model that finds the optimal multimodal freight transportation plan for manufacturing companies during a planning horizon. The model considers road and sea transportation options. The sea transportation requires chartering at least one ship among...
Persistent link: https://www.econbiz.de/10010986873
Data Envelopment Analysis (DEA) is a methodology that computes efficiency values for decision making units (DMU) in a given period by comparing the outputs with the inputs. In many applications, inputs and outputs of DMUs are monitored over time. There might be a time lag between the consumption...
Persistent link: https://www.econbiz.de/10005809921
We develop a model for flexibly ranking multi-dimensional alternatives/units into preference classes via Mixed Integer Programming. We consider a linear aggregation model, but allow the criterion weights to vary within pre-specified ranges. This allows the individual alternatives/units to play...
Persistent link: https://www.econbiz.de/10008483387
In this paper, we study traveling salesperson (TSP) and bottleneck traveling salesperson (BTSP) problems on special graphs called Halin graphs. Although both problems are NP-Hard on general graphs, they are polynomially solvable on Halin graphs. We address the multiobjective versions of these...
Persistent link: https://www.econbiz.de/10005284024
In this paper, we present an exact algorithm to find all extreme supported nondominated points of multiobjective mixed integer programs. The algorithm uses a composite linear objective function and finds all the desired points in a finite number of steps by changing the weights of the objective...
Persistent link: https://www.econbiz.de/10009208750
Persistent link: https://www.econbiz.de/10008775652
Persistent link: https://www.econbiz.de/10008712310