Single machine common flow allowance scheduling with controllable processing times
From MaRDI portal
Publication:2504094
DOI10.1007/BF02896403zbMath1105.90029OpenAlexW2091431505MaRDI QIDQ2504094
Publication date: 22 September 2006
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02896403
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (8)
Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance ⋮ A note: minmax due-date assignment problem with lead-time cost ⋮ Batch scheduling of identical jobs with controllable processing times ⋮ Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance ⋮ Single machine scheduling with common due date and controllable processing times ⋮ Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration
Cites Work
- A survey of results for sequencing problems with controllable processing times
- A two-machine flow shop scheduling problem with controllable job processing times
- A bicriterion approach to time/cost trade-offs in sequencing
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- Single-machine sequencing with controllable processing times
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- Single machine batch scheduling with jointly compressible setup and processing times.
- Some comments on sequencing with controllable processing times
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
- Resource optimal control in some single-machine scheduling problems
- Single Machine Scheduling with Flow Allowances
This page was built for publication: Single machine common flow allowance scheduling with controllable processing times