A mathematical programming-based scheduling framework for multitasking environments
From MaRDI portal
Publication:2432894
DOI10.1016/j.ejor.2005.06.062zbMath1137.90519OpenAlexW1971238990MaRDI QIDQ2432894
Rasaratnam Logendran, Shakib Shakeri
Publication date: 25 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.062
multitasking(T) integer programming(B) scheduling-single resource(S) deteriorating jobs(S) preemptive scheduling(S) tabu search(S) time dependent processing timemodeling human behavior
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)
Related Items
Importance of verifying queue model assumptions before planning with simulation software ⋮ Bee colony optimization for scheduling independent tasks to identical processors
Uses Software
Cites Work
- Unnamed Item
- A concise survey of scheduling with time-dependent processing times
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems
- Minimizing maximum lateness under linear deterioration