Reclaimer Scheduling in Dry Bulk Terminals
This paper studies a complex parallel scheduling problem with non-crossing constraint, sequence dependent setup times, eligibility restrictions, and precedence relationships motivated by reclaimer scheduling in dry bulk terminals. In a stockyard of any dry bulk terminal, stockpiles are handled by re...
Guardado en:
Autor principal: | Ozgur Unsal |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
IEEE
2020
|
Materias: | |
Acceso en línea: | https://doaj.org/article/f166b274ef31415290847c38a6424db5 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem
por: Jesús Isaac Vázquez-Serrano, et al.
Publicado: (2021) -
An Optimization Model for a New Scheduling Problem: Application in a Molecular Biology Lab
por: Guierdy Concha, et al.
Publicado: (2021) -
Robust Fuzzy-Stochastic Programming Model and Meta-Heuristic Algorithms for Dual-Resource Constrained Flexible Job-Shop Scheduling Problem Under Machine Breakdown
por: Parham Soofi, et al.
Publicado: (2021) -
Energy-Efficient UAV-to-User Scheduling to Maximize Throughput in Wireless Networks
por: Shakil Ahmed, et al.
Publicado: (2020) -
A Comprehensive Modeling of the Discrete and Dynamic Problem of Berth Allocation in Maritime Terminals
por: Sami Mnasri, et al.
Publicado: (2021)