Article
Computer Science, Interdisciplinary Applications
Serkan Kalay, Z. Caner Taskin
Summary: The study focuses on production planning in process industries with costly sequence dependent family setups, specifically addressing the unique characteristics of float glass manufacturing. By developing a branch-and-price algorithm, consistent performance across different problem sizes is achieved and compared with previous work through computational experiments.
COMPUTERS & OPERATIONS RESEARCH
(2021)
Article
Computer Science, Interdisciplinary Applications
Juan C. Yepes-Borrero, Federico Perea, Fulgencia Villa, Eva Vallada
Summary: The paper addresses the Permutation Flowshop Scheduling problem with additional Resources during Setups (PFSR-S) for the first time. Two Mixed Integer Linear Programming formulations and an exact algorithm are proposed to solve the problem. Due to its complexity, a GRASP metaheuristic is also proposed which provides solutions for larger instances. The computational testing shows that the GRASP metaheuristic finds good quality solutions in short computational times.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Transportation Science & Technology
Faisal Alkaabneh, Ali Diabat
Summary: The application of optimization techniques to home care service planning has gained attention due to the increasing demand for dedicated care. A mixed integer programming model is developed to simultaneously consider nurse-patient assignment, nurse workday scheduling, and nurse routing. The multi-objective model aims to minimize costs and maximize compatibility between nurses and patients. Computational studies demonstrate the superiority of the developed approaches in terms of cost savings, improved compatibility, and solving efficiency.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
(2023)
Article
Economics
Baoli Liu, Zhi-Chun Li, Yadong Wang
Summary: This study addresses the operational problem of an LNG bunkering station in inland waterways. A mixed-integer linear programming (MILP) model and a tailored branch-and-price heuristic (BPH) algorithm are developed to solve the problem. Numerical experiments show satisfactory performance of the solution algorithm, and managerial implications are obtained for station operators.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
(2023)
Article
Management
Mohammad Reihaneh, Sina Ansari, Farbod Farhadi
Summary: This study proposes a solution for scheduling patient appointments at a hemodialysis center, using a set-partitioning problem formulation and employing Branch and Price algorithm, embedded Column Generation algorithm, and a greedy heuristic. The proposed algorithms significantly improve the percentage of leftover appointments and the hours of deviations per patient compared to the current policy.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Management
Tessa Borgonjon, Broos Maenhout
Summary: The paper investigates the problem of personnel task rescheduling with task retiming, proposing a branch-and-price procedure for recovering the personnel task schedule and showing its performance through computational experiments with different optimization principles.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Computer Science, Interdisciplinary Applications
Onur Ozturk
Summary: This paper investigates a scheduling problem involving simultaneous serial and parallel batching decisions, aiming to minimize total flow time and total weighted tardiness. The problem is formulated as an integer linear programming model and solved using a column generation algorithm integrated in a branch and bound tree. A highly efficient heuristic branching technique is used for the total weighted tardiness objective, with optimality proven for the total flow time objective. Numerical test results demonstrate the algorithm's ability to handle large instances within reasonable computational times.
COMPUTERS & OPERATIONS RESEARCH
(2022)
Article
Mathematics, Applied
Ji-Bo Wang, Li-Han Zhang, Zheng-Guo Lv, Dan-Yang Lv, Xin-Na Geng, Xinyu Sun
Summary: This paper addresses the single-machine scheduling problems with truncated learning effects and proposes heuristic and branch-and-bound algorithms to determine the optimal job schedule for minimizing the makespan, total weighted completion time, and maximum lateness. Extensive numerical experiments validate the efficiency of the proposed solution algorithms on a set of randomly generated instances.
COMPUTATIONAL & APPLIED MATHEMATICS
(2022)
Article
Management
Yifu Li, Xiangtong Qi
Summary: In the service industry, the perception of a service bundle by customers depends not only on the utility of each activity but also on the sequence of activities. This presents an opportunity for service providers to optimize service bundles by manipulating activities and their sequence.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Mathematical & Computational Biology
Lu-Wen Liao
Summary: In the current era of multimedia, television plays a crucial role in transmitting advertising messages, making it the primary source of revenue for the TV industry. The scheduling of commercials on different TV channels to maximize revenue and minimize penalties is a critical issue for TV stations. This study proposes an exact branch and bound algorithm based on the LFJ/EDD rules and network flow methods to schedule commercials with specific service-level requirements while minimizing the maximum lateness. The computational analysis demonstrates the effectiveness of the proposed bounding scheme and the algorithm's ability to obtain optimal solutions.
MATHEMATICAL BIOSCIENCES AND ENGINEERING
(2022)
Article
Engineering, Chemical
Prashanth Ravula, Mohd Shahrukh, Rajagopalan Srinivasan, I. A. Karimi
Summary: The increasing demand for LNG as a transition fuel has led to innovations in its trade and transportation. This study proposes a mathematical model that incorporates split delivery, a recent innovation in LNG transportation, to optimize procurement costs. The model saves costs and offers fair benefit allocation among terminals through two allocation schemes.
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH
(2022)
Article
Management
Ihsan Yanikoglu, Tonguc Yavuz
Summary: This paper investigates a machine scheduling problem on unrelated parallel machines with the objective of minimizing the worst-case total tardiness. The authors propose a robust optimization model and discuss important properties of the mathematical formulation. The paper also addresses the issue of alternative optimal solutions for scheduling problems and presents a branch-and-price algorithm to solve realistic instances effectively. Numerical results demonstrate the effectiveness of the proposed approach in terms of optimality and improvement in objective function value.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Computer Science, Interdisciplinary Applications
Canrong Zhang, Dandan Zhang, Tao Wu
Summary: The paper proposes two mixed integer programming models for solving the capacitated lot-sizing and machine scheduling problem with sequence-dependent setup time and setup carryover, presents a Dantzig-Wolfe decomposition per machine to improve lower bounds, and uses a branching and selection method to solve the problem.
COMPUTERS & OPERATIONS RESEARCH
(2021)
Article
Computer Science, Interdisciplinary Applications
Gang Wang
Summary: This paper presents an alternate approach for addressing the challenge of designing a stochastic supply chain by formulating a stochastic mixed-integer program and solving it using a branch-and-price scheme and heuristic algorithms. The study finds that network design performance depends on aggregate service levels and maximum demand variations.
COMPUTERS & INDUSTRIAL ENGINEERING
(2023)
Article
Management
Weikang Guo, Mario Vanhoucke, Jose Coelho
Summary: A structured prediction approach is introduced to rank various combinations of components of the integrated branch-and-bound (B&B) procedure for resource-constrained project scheduling problem. Two regression methods are used to map project indicators to a full ranking of configurations. Experimental results show that this approach can generate significantly better results than any single-best configuration.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
