Single machine scheduling with discretely controllable processing times
From MaRDI portal
Recommendations
- Multi-rule single machine scheduling with discretely controllable processing times
- Batch delivery scheduling with discretely controllable processing times
- scientific article; zbMATH DE number 5630568
- Single machine scheduling with controllable release and processing parameters
- scientific article; zbMATH DE number 2044496
Cites work
- `` Strong NP-Completeness Results
- A bicriterion approach to time/cost trade-offs in sequencing
- A survey of results for sequencing problems with controllable processing times
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Flow Shop Scheduling with Resource Flexibility
- Network flows. Theory, algorithms, and applications.
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Reducibility among combinatorial problems
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- Scheduling Multiple Variable-Speed Machines
- Scheduling to minimize the total compression and late costs
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
- Single-machine sequencing with controllable processing times
- Two parallel machine sequencing problems involving controllable job processing times
Cited in
(36)- Minimizing total tardiness on a single machine with controllable processing times
- 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.
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Scheduling two projects with controllable processing times in a single-machine environment
- Single-machine scheduling with machine unavailability periods and resource dependent processing times
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- A survey of scheduling with controllable processing times
- Single machine scheduling with controllable release and processing parameters
- Approximation schemes for job shop scheduling problems with controllable processing times
- Scheduling with discretely compressible release dates to minimize makespan
- A Review for Submodular Optimization on Machine Scheduling Problems
- Two FPTAS algorithms of problem \(1|r_j\), dm\(|C_{\max}+TPC\)
- A decomposition approach to job-shop scheduling problem with discretely controllable processing times
- scientific article; zbMATH DE number 2044496 (Why is no real title available?)
- scientific article; zbMATH DE number 1547866 (Why is no real title available?)
- scientific article; zbMATH DE number 1870508 (Why is no real title available?)
- scientific article; zbMATH DE number 6177807 (Why is no real title available?)
- Batch delivery scheduling with discretely controllable processing times
- Multi-rule single machine scheduling with discretely controllable processing times
- A 32-approximation algorithm for parallel machine scheduling with controllable processing times
- Single machine batch scheduling with resource dependent setup and processing times
- Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times
- Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- Single machine scheduling with resource dependent release times and processing times
- Single machine group scheduling with resource dependent setup and processing times
- Optimal energy scheduling under time-of-use tariffs
- Single-machine scheduling with trade-off between number of tardy jobs and compression cost
- Considering manufacturing cost and scheduling performance on a CNC turning machine
- Single machine scheduling problem with controllable processing times and resource dependent release times
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
This page was built for publication: Single machine scheduling with discretely controllable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373460)
