Total Tardiness Minimization in a Single-Machine with Periodical Resource Constraints
In this paper we introduce a variant of the single machine considering resource restriction per period. The objective function to be minimized is the total tardiness. We proposed an integer linear programming modeling based on a bin packing formulation. In view of the NP-hardness of the introduced...
Main Authors: | Bruno Prata, Levi Ribeiro Abreu, Marcelo Seido Nagano |
---|---|
Format: | Article |
Language: | English |
Published: |
Universitas Andalas
2022-12-01
|
Series: | Jurnal Optimasi Sistem Industri |
Subjects: | |
Online Access: | https://josi.ft.unand.ac.id/index.php/josi/article/view/606 |
Similar Items
-
A Quantum-Inspired Ant Colony Optimization Algorithm for Parking Lot Rental to Shared E-Scooter Services
by: Antonella Nardin, et al.
Published: (2024-02-01) -
A Matheuristic Approach for the No-Wait Flowshop Scheduling Problem with Makespan Criterion
by: Yu Gao, et al.
Published: (2022-04-01) -
A Matheuristic Approach for the Multi-Depot Periodic Petrol Station Replenishment Problem
by: Pasquale Carotenuto, et al.
Published: (2024-01-01) -
A matheuristic algorithm for the three dimensional loading capacitated vehicle routing problem (3L-CVRP)
by: Luis Miguel Escobar-Falcón, et al.
Published: (2016-03-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)