Multitasking via alternate and shared processing: algorithms and complexity
From MaRDI portal
Publication:284835
DOI10.1016/J.DAM.2016.03.018zbMATH Open1343.90035OpenAlexW2509139847MaRDI QIDQ284835FDOQ284835
Authors: Nicholas G. Hall, Joseph Y.-T. Leung, Chung-Lun Li 
Publication date: 18 May 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.03.018
Recommendations
Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Queueing systems with vacations - a survey
- Scheduling. Theory, algorithms, and systems.
- Control of the service process in a queueing system
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints
- Minimizing Total Tardiness on One Machine is NP-Hard
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Technical Note—Minimizing Average Flow Time with Parallel Machines
Cited In (12)
- Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
- Fatigue, personnel scheduling and operations: review and research opportunities
- Multitasking scheduling problems with two competitive agents
- On the optimization of multitasking process with multiplayer
- A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines
- Multitasking scheduling with alternate periods
- Streaming algorithms for multitasking scheduling with shared processing
- Single-machine multitasking scheduling with job efficiency promotion
- Multitasking scheduling with shared processing
- Due date assignment and two-agent scheduling under multitasking environment
- Multitasking scheduling with multiple rate‐modifying activities
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones
This page was built for publication: Multitasking via alternate and shared processing: algorithms and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284835)
