Matheuristic Algorithm for Job-Shop Scheduling Problem Using a Disjunctive Mathematical Model
This paper focuses on the investigation of a new efficient method for solving machine scheduling and sequencing problems. The complexity of production systems significantly affects companies, especially small- and medium-sized enterprises (SMEs), which need to reduce costs and, at the same time, bec...
Main Authors: | Eduardo Guzman, Beatriz Andres, Raul Poler |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-12-01
|
Series: | Computers |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-431X/11/1/1 |
Similar Items
-
A Decision-Making Tool for Algorithm Selection Based on a Fuzzy TOPSIS Approach to Solve Replenishment, Production and Distribution Planning Problems
by: Eduardo Guzman, et al.
Published: (2022-05-01) -
A Matheuristic Approach for the No-Wait Flowshop Scheduling Problem with Makespan Criterion
by: Yu Gao, et al.
Published: (2022-04-01) -
Late Acceptance Hill-Climbing Matheuristic for the General Lot Sizing and Scheduling Problem with Rich Constraints
by: Andreas Goerler, et al.
Published: (2020-06-01) -
UAV routing with genetic algorithm based matheuristic for border security missions
by: Omer Ozkan, et al.
Published: (2021-04-01) -
A Matheuristic Algorithm for the Multiple-Depot Vehicle and Crew Scheduling Problem
by: Emiliana Mara Lopes Simoes, et al.
Published: (2021-01-01)