Optimization of transport constraints and quality of service for joint resolution of uncertain scheduling and the job-shop problem with routing (JSSPR) as opposed to the job-shop problem with transport (JSSPT)
To better meet the qualitative and quantitative requirements of customers or relevant sector managers, workshop environments are implementing increasingly complex task management systems. The job shop scheduling problem (JSSP) involves assigning each task to a single machine while schedulin...
Main Authors: | Khadija Assafra, Bechir Alaya, Salah Zidi, Mounir Zrigui |
---|---|
Format: | Article |
Language: | English |
Published: |
Growing Science
2024-01-01
|
Series: | Journal of Project Management |
Online Access: | http://www.growingscience.com/jpm/Vol9/jpm_2024_2.pdf |
Similar Items
-
Job shop scheduling problem (JSSP)
by: Abdullah, Nurul Azma
Published: (2004) -
An improved memetic algorithm for the flexible job shop scheduling problem with transportation times
by: Guohui Zhang, et al.
Published: (2020-08-01) -
A new mathematical model for the job shop scheduling problem with uncertain processing times
by: M. A. Shafia, et al.
Published: (2011-04-01) -
Blocking Cyclic Job-Shop Scheduling Problems
by: Atabak Elmi, et al.
Published: (2022-10-01) -
Energy-Saving Scheduling for Flexible Job Shop Problem with AGV Transportation Considering Emergencies
by: Hongliang Zhang, et al.
Published: (2023-02-01)