An electromagnetism-like metaheuristic for open-shop problems with no buffer

This paper considers open-shop scheduling with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program. The problem can be optimally solved by the model. The paper also develops a novel metaheuristic based on an electromagnetism algorithm to solve the large-sized problems. The paper conducts two computational experiments. The first includes small-sized instances by which the mathematical model and general performance of the proposed metaheuristic are evaluated. The second evaluates the metaheuristic for its performance to solve some large-sized instances. The results show that the model and algorithm are effective to deal with the problem

An Annotated Bibliography for Post-solution Analysis in Mixed Integer Programming and Combinatorial Optimization

Abstract This annotated bibliography focuses on what has been published since the 1977 Geoffrion-Nauss survey, and it is in BibTEX format, so it can be searched on the World Wide Web. In addition to postoptimal sensitivity analysis, this survey includes debugging a run, such as when the integer program is unbounded, anomalous or infeasible