Batch scheduling of identical jobs with controllable processing times
From MaRDI portal
(Redirected from Publication:336773)
Recommendations
- Batch scheduling with controllable setup and processing times to minimize total completion time
- scientific article; zbMATH DE number 5630568
- Single machine batch scheduling with jointly compressible setup and processing times.
- Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
- Single machine batch scheduling problem to minimize makespan with controllable setup and jobs processing times
Cites work
- A bicriterion approach to time/cost trade-offs in sequencing
- A polynomial algorithm for a one machine batching problem
- A survey of scheduling problems with setup times or costs
- A survey of scheduling with controllable processing times
- An anticipative scheduling approach with controllable processing times
- Batch scheduling of identical jobs on parallel identical machines
- Batching in single operation manufacturing systems
- Batching to Minimize Flow Times on Parallel Heterogeneous Machines
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Complexity of a scheduling problem with controllable processing times
- Just-in-time scheduling with controllable processing times on parallel machines
- Minimizing flow-time on a single machine with integer batch sizes
- Minimizing total tardiness on a single machine with controllable processing times
- One-pass batching algorithms for the one-machine problem
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Optimal due date assignment and resource allocation in a group technology scheduling environment
- Positive half-products and scheduling with controllable processing times
- Pre-emptive scheduling problems with controllable processing times
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
- Scheduling jobs with controllable processing times as an optimal control problem
- Scheduling two agents with controllable processing times
- Scheduling with tool changes to minimize total completion time under controllable machining conditions
- Single machine common flow allowance scheduling with controllable processing times
- Single machine scheduling problems with controllable processing times and total absolute differences penalties
- Single machine scheduling subject to deadlines and resource dependent processing times
- Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
- Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
- Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
- Single-machine scheduling with time-and-resource-dependent processing times
- Some comments on sequencing with controllable processing times
- Two-machine flowshop scheduling with flexible operations and controllable processing times
Cited in
(12)- Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times
- Throughput optimization for the robotic cell problem with controllable processing times
- Batch delivery scheduling with discretely controllable processing times
- Single machine resource allocation scheduling problems with deterioration effect and general positional effect
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Batch scheduling with controllable setup and processing times to minimize total completion time
- scientific article; zbMATH DE number 5630568 (Why is no real title available?)
- Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities
- Scheduling a batching machine with convex resource consumption functions
- A bicriteria approach for single machine scheduling with resource allocation, learning effect and a deteriorating maintenance activity
- Single machine batch scheduling with jointly compressible setup and processing times.
- Scheduling with batching: Two job types
This page was built for publication: Batch scheduling of identical jobs with controllable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336773)
