Article
Management
Sergey Polyakovskiy, Rym M'Hallah
Summary: This paper studies the on-time guillotine cutting of small rectangular items from large rectangular bins, modeled as an integrated constraint program. It also proposes two decomposition cut-and-check approaches. Computational testing under heuristic assumptions shows that the integrated constraint programming approach performs relatively well, outperforming the decomposition approach with CP as the master problem.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
(2021)
Article
Computer Science, Interdisciplinary Applications
Fuli Xiong, Mengling Chu, Zhi Li, Yao Du, Linting Wang
Summary: This paper focuses on the distributed concrete precast flow shop scheduling problem, proposing a novel mixed integer linear programming model and solving the NP-hard problem by iterated greedy algorithm and tabu search algorithm. The computational analysis shows the effectiveness of the proposed algorithms.
COMPUTERS & OPERATIONS RESEARCH
(2021)
Article
Management
Mohammad Mahdi Ahmadian, Amir Salehipour, T. C. E. Cheng
Summary: JIT-JSS is a variant of the job-shop scheduling problem with distinct due-dates for each operation. A VNS algorithm is developed to solve JIT-JSS by decomposing the problem, obtaining optimal operation sequences, and generating schedules. The algorithm shows efficacy by obtaining new best solutions for a significant number of instances.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Computer Science, Interdisciplinary Applications
Gustavo Alencar Rolim, Marcelo Seido Nagano, Bruno de Athayde Prata
Summary: This paper addresses an unrelated parallel machine scheduling problem inspired by semiconductor manufacturing and other production systems. The objective is to minimize the sum of weighted earliness and tardiness penalties when jobs have a common due window. The authors propose two mixed-integer linear programming formulations, derive necessary conditions for an optimal schedule, and introduce two constructive heuristics. They also present a novel adaptive large neighborhood search algorithm that outperforms other methods in extensive computational experiments.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Mathematics, Interdisciplinary Applications
Oguzhan Ahmet Arik
Summary: This paper presents a mixed-integer programming model for a single machine earliness/tardiness scheduling problem aiming to minimize total earliness/tardiness duration. The uncertainty of parameters such as processing times and due date is coded with grey numbers, and an effective heuristic method is proposed using expected processing times. The research contributes to the literature by utilizing grey theory and numbers in machine scheduling problems.
GREY SYSTEMS-THEORY AND APPLICATION
(2021)
Article
Mathematics, Applied
Wanlei Wang
Summary: This paper investigates the single-machine due-date assignment problem with past-sequence-dependent setup times, proposing optimal solutions under different due-date assignment scenarios. The problem is proven to be solvable in polynomial time by minimizing a linear weighted sum. Furthermore, three extensions are provided by considering various dependencies in processing times.
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING
(2022)
Article
Computer Science, Interdisciplinary Applications
Hongbin Zhang, Yu Yang, Feng Wu
Summary: In this paper, we study a single-batch-processing machine scheduling problem by considering a just-in-time criterion. We propose a mixed-integer linear model to model the problem and design two priority rules for job sorting. We also propose two heuristic algorithms and a lower bound method for constructing and improving near-optimal schedules. The extensive numerical experiments demonstrate the effectiveness and efficiency of our approaches.
COMPUTERS & OPERATIONS RESEARCH
(2022)
Article
Management
Zhichao Geng, Jinjiang Yuan
Summary: This paper addresses the single-machine multiple-project scheduling problem with controllable processing times, considering the cost factors and precedence constraints. Four specific problems are studied, involving minimizing total cost, common due dates, fixed number of projects, and identical weights. The paper provides complexity analysis and solutions for each problem variant.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Review
Management
Bahram Alidaee, Haitao Li, Haibo Wang, Keith Womer
Summary: This paper discusses scheduling with arbitrary due dates and no idle time permitted between jobs, aiming to minimize the total earliness and tardiness. Mathematical programming formulations for single and parallel machine problems with fixed and controllable processing and setup times are reviewed, weaknesses are identified, corrections/improvements are provided, and further research directions are suggested.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
(2021)
Article
Mathematics
Jin Qian, Yu Zhan
Summary: This paper discusses the scheduling problem for a single machine, taking into account due window, delivery time, and deteriorating jobs. The objective is to minimize the window location, window size, earliness, and tardiness. Both common due window and slack due window are considered. The delivery time depends on the actual processing time of previous sequences, which is an increasing function of the start time. By utilizing small perturbations and adjacent exchange techniques, propositions for the problems are obtained. Polynomial time solvability in O(nlogn) time is proven for both common and slack due window assignment. The paper also proposes algorithms to obtain the optimal sequence, window location, and window size.
Article
Computer Science, Artificial Intelligence
Ece Yagmur, Saadettin Erhan Kesen
Summary: This paper addresses the problem of integrated production and distribution scheduling, where orders/jobs are performed on identical machines in parallel and then distributed to customers through vehicles. The objective is to minimize the overall cost, which includes early and tardy deliveries, production and distribution costs. The paper proposes a formulation involving parallel machine scheduling and vehicle routing, and presents two metaheuristics (Memetic Algorithm and Iterated Local Search) to obtain optimal solutions for practical-sized instances. Computational results show that Iterated Local Search outperforms Memetic Algorithm in terms of solution quality and computational time.
EXPERT SYSTEMS WITH APPLICATIONS
(2024)
Article
Computer Science, Artificial Intelligence
Oguzhan Ahmet Arik, Marco Schutten, Engin Topan
Summary: This paper investigates an unrelated parallel machine scheduling problem with a restrictive common due date and proposes construction-based heuristics and local search algorithms to minimize earliness/tardiness costs. By optimizing start times of machines and job assignment patterns, it achieves a balanced workload per machine and outperforms metaheuristics in solution quality.
EXPERT SYSTEMS WITH APPLICATIONS
(2022)
Article
Engineering, Industrial
Jeffrey Schaller, Jorge M. S. Valente
Summary: This paper addresses the scheduling of jobs in a no-wait flow shop with the goal of minimizing total earliness and tardiness. Various dispatching heuristics and insertion improvement procedures are developed and tested, showing that the two-phase heuristics and insertion search improvement procedure can significantly improve performance.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2022)
Article
Engineering, Multidisciplinary
Yuncheng Luo
Summary: This paper investigates a static stochastic single machine JIT scheduling problem, proving that the optimal schedule is V-shaped under specific conditions and designing a dynamic programming algorithm to achieve the optimal V-shaped schedule.
MATHEMATICAL PROBLEMS IN ENGINEERING
(2021)
Article
Engineering, Industrial
Mohammad Namakshenas, Aleida Braaksma, Mohammad Mahdavi Mazdeh
Summary: This study addresses a class of resource-constrained scheduling problems with non-renewable resources supplied in different periods, aiming to minimize total tardiness and total earliness. The optimal schedules are discussed and a tractable algorithm is developed, showing promising performance guarantee in scalability tests.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2022)
Article
Engineering, Multidisciplinary
Vahid Kayvanfar, S. M. Moattar Husseini, B. Karimi, Mohsen S. Sajadieh
ENGINEERING OPTIMIZATION
(2018)
Article
Engineering, Manufacturing
Amin Aalaei, Vahid Kayvanfar, Hamid Davoudpour
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE
(2019)
Article
Computer Science, Interdisciplinary Applications
Nima Moradi, Vahid Kayvanfar, Majid Rafiee
Summary: The 0-1 knapsack problem is a classic problem with various applications, and this paper compares different SA-based algorithms to find the most efficient one. The proposed population-based SA algorithm (PSA) outperforms other SA-based solvers in terms of exploration and exploitation, making it a promising approach for future optimization algorithms in KP01.
ENGINEERING WITH COMPUTERS
(2022)
Article
Environmental Sciences
Pouria Khodabandeh, Vahid Kayvanfar, Majid Rafiee, Frank Werner
Summary: Management of home health care is a key concern for governments and decision-makers, with the study finding that upgrading costs can lead to significant hidden costs for companies.
INTERNATIONAL JOURNAL OF ENVIRONMENTAL RESEARCH AND PUBLIC HEALTH
(2021)
Article
Management
Amin Zaheri, Majid Rafiee, Vahid Kayvanfar
Summary: This paper studies the impact of discounts on the relationships between a manufacturer and a retailer, comparing members' profits under cooperative and non-cooperative games. By modeling through different approaches, it analyzes members' profits and their inclination to change, providing a decision-making tool for maximizing profits.
JOURNAL OF MODELLING IN MANAGEMENT
(2021)
Article
Operations Research & Management Science
Elham Rastpour, Vahid Kayvanfar, Majid Rafiee
Summary: This research aims to determine the main criteria of green supply chain management and provide a framework for assessing and comparing the greenness of dairy industries. Through literature study and expert opinions, the framework is developed and evaluated using various methods. The findings from this research provide valuable insights for companies in terms of their greenness and functionality.
INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT
(2022)
Article
Engineering, Industrial
Vahid Kayvanfar, M. Zandieh, Mehrdad Arashpour
Summary: This research investigates the economic lot scheduling problem and proposes a hybrid algorithm that outperforms other algorithms in terms of solution quality and diversity.
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE-OPERATIONS & LOGISTICS
(2022)
Article
Engineering, Multidisciplinary
Majid Rafiee, Vahid Kayvanfar, Atieh Mohammadi, Frank Werner
Summary: This paper investigates the operator assignment problem in cellular manufacturing systems, with a focus on operator learning and forgetting effects, as well as handling uncertain parameters. Numerical instances solving and statistical analysis of the model were conducted to gain managerial insights.
APPLIED MATHEMATICAL MODELLING
(2022)
Article
Economics
Farid Kochakkashani, Vahid Kayvanfar, Alireza Haji
Summary: This study aims to support pharmaceutical supply chain planning during the COVID-19 epidemic by providing a mathematical model. The model minimizes costs and maintains an acceptable service level. Clustering of pharmaceuticals and vaccines reduces problem size and solving time.
SOCIO-ECONOMIC PLANNING SCIENCES
(2023)
Article
Social Sciences, Interdisciplinary
Atefeh Naseri, Vahid Kayvanfar, Shaya Sheikh, Frank Werner
Summary: This research explores the impact of social media on the marketing goals of organizations in Iran during the COVID-19 pandemic. The results show a significant positive relationship between the use of social media and distraction level, and the gender of marketers has an impact on the perceived usefulness and application of social media. Additionally, working hours per day positively affect social media usage and marketing performance.
SOCIAL SCIENCES-BASEL
(2022)
Article
Mathematics, Applied
Pouria Khodabandeh, Vahid Kayvanfar, Majid Rafiee, Frank Werner
Summary: In this study, a new mathematical model is proposed to address the issue of flexibility in starting/ending places of nurses' routes when providing services at patients' homes. The efficiency of the proposed approach is confirmed through real-world problem solving, and sensitivity analyses on the required features of the services provide insights for management and future studies.
Review
Hospitality, Leisure, Sport & Tourism
Ramina Khorsand, Majid Rafiee, Vahid Kayvanfar
TOURISM MANAGEMENT PERSPECTIVES
(2020)
Article
Operations Research & Management Science
Shaya Sheikh, G. M. Komaki, Vahid Kayvanfar, Ehsan Teymourian
OPERATIONS RESEARCH PERSPECTIVES
(2019)
Article
Management
Vahid Kayvanfar, S. M. Moattar Husseini, Zhang NengSheng, Behrooz Karimi, Mohsen S. Sajadieh
MANAGEMENT RESEARCH REVIEW
(2019)
Proceedings Paper
Computer Science, Artificial Intelligence
Vahid Kayvanfar, Shaya Sheikh, G. M. Komaki
2018 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA)
(2018)