A mathematical programming-based scheduling framework for multitasking environments
From MaRDI portal
Publication:2432894
Recommendations
- Multitasking scheduling problems with deterioration effect
- Deadline scheduling of multiprocessor tasks
- Scheduling jobs under simple linear deterioration
- Scheduling with deteriorating jobs and non-simultaneous machine available times
- A tabu method for a two-agent single-machine scheduling with deterioration jobs
Cites work
- scientific article; zbMATH DE number 3693076 (Why is no real title available?)
- A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems
- A concise survey of scheduling with time-dependent processing times
- Minimizing maximum lateness under linear deterioration
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling with time dependent processing times: Review and extensions
Cited in
(6)- scientific article; zbMATH DE number 5994841 (Why is no real title available?)
- Importance of verifying queue model assumptions before planning with simulation software
- Mathematical model for scheduling operations in cascaded continuous processing units
- Scheduling in multi-scenario environment with an agreeable condition on job processing times
- Task scheduling for multiunit parallel test using mixed-integer linear programming
- Bee colony optimization for scheduling independent tasks to identical processors
This page was built for publication: A mathematical programming-based scheduling framework for multitasking environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432894)