Showing 1 - 10 of 12
<Para ID="Par1">Recently, a walk-and-round heuristic was proposed by Huang and Mehrotra (Comput Optim Appl, <CitationRef CitationID="CR24">2012</CitationRef>) for generating high quality feasible solutions of mixed integer linear programs. This approach uses geometric random walks on a polyhedral set to sample points in this set. It subsequently rounds...</citationref></para>
Persistent link: https://www.econbiz.de/10011241276
Feasibility pump is a general purpose technique for finding feasible solutions of mixed integer programs. In this paper we report our computational experience on using geometric random walks and a random ray approach to provide good points for the feasibility pump. Computational results on <Emphasis...</emphasis>
Persistent link: https://www.econbiz.de/10010998362
Persistent link: https://www.econbiz.de/10005417785
Persistent link: https://www.econbiz.de/10005417827
In recent years, many firms have become aware that environmental issues are critical barriers to the sustainability of a business. To overcome these barriers, several studies have been conducted to develop quantitative measurements associated with industry practices to prevent pollution and...
Persistent link: https://www.econbiz.de/10011116436
This paper considers a real-life identical parallel scheduling problem originating from the manufacturing plant producing polyvinyl chloride leather products. In the considered scheduling problem, each job has some attributes and each attribute has several different levels. Because there is at...
Persistent link: https://www.econbiz.de/10010776686
In the scheduling literature, it is often assumed that jobs arrive either simultaneously or individually. However, this assumption is invalid in most practical situations because jobs usually arrive in batches, e.g., the final testing house in the manufacturing of semiconductor. The concept of...
Persistent link: https://www.econbiz.de/10008521497
We consider an n-job, m-machine lot-streaming problem in a flowshop with equal-size sublots where the objective is to minimize the total weighted earliness and tardiness. To solve this problem, we first propose a so-called net benefit of movement (NBM) algorithm, which is much more efficient...
Persistent link: https://www.econbiz.de/10005337086
This paper is concerned with coordination aspects of supply chain management and, in particular, investigates setup coordination between two and three stages of a supply chain. The problem arises from a real application in the production chain of a kitchen furniture plant. In different stages of...
Persistent link: https://www.econbiz.de/10005339667
Persistent link: https://www.econbiz.de/10005311748