Just-in-time scheduling with controllable processing times on parallel machines
From MaRDI portal
(Redirected from Publication:975765)
Recommendations
- scientific article; zbMATH DE number 2044496
- scientific article; zbMATH DE number 5951383
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- A survey of scheduling with controllable processing times
- Approximation schemes for job shop scheduling problems with controllable processing times
Cites work
- scientific article; zbMATH DE number 4035555 (Why is no real title available?)
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- A bicriterion approach to time/cost trade-offs in sequencing
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- A sequential algorithm for finding a maximum weightK-independent set on interval graphs
- A survey of results for sequencing problems with controllable processing times
- A survey of scheduling with controllable processing times
- Algorithms for Scheduling Independent Tasks
- Allocation of resources in project management
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Cost-effectiveness of a preventive counseling and support package for postnatal depression
- Finding the largest suborder of fixed width
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- General flow-shop scheduling with resource constraints
- Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Interval scheduling on identical machines
- Job-shop scheduling with convex models of operations
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- Maximum \(k\)-covering of weighted transitive graphs with applications
- Maximum weightk-independent set problem on permutation graphs
- Minimization of the makespan in a two-machine problem under given resource constraints
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
- On chain and antichain families of a partially ordered set
- On the \(k\)-coloring of intervals
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies
- Positive half-products and scheduling with controllable processing times
- Pre-emptive scheduling problems with controllable processing times
- Resource management in machine scheduling problems: a survey
- Scheduling Multiple Variable-Speed Machines
- Scheduling jobs with fixed start and end times
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Single machine scheduling subject to deadlines and resource dependent processing times
- Single machine scheduling to minimize the number of early and tardy jobs
- Single machine scheduling with controllable release and processing parameters
- Solving a class of two-resource allocation problem by equivalent load method
- Some comments on sequencing with controllable processing times
- The maximum k-colorable subgraph problem for chordal graphs
- Two parallel machine sequencing problems involving controllable job processing times
Cited in
(19)- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
- Parallel machine scheduling with a convex resource consumption function
- scientific article; zbMATH DE number 2139462 (Why is no real title available?)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- scientific article; zbMATH DE number 5951383 (Why is no real title available?)
- Scheduling two agents with controllable processing times
- Single machine resource allocation scheduling problems with deterioration effect and general positional effect
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Models and algorithms for energy-efficient scheduling with immediate start of jobs
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
- Simultaneous job scheduling and resource allocation on parallel machines
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- On the parameterized complexity of interval scheduling with eligible machine sets
- Batch scheduling of identical jobs with controllable processing times
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- scientific article; zbMATH DE number 2044496 (Why is no real title available?)
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
This page was built for publication: Just-in-time scheduling with controllable processing times on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975765)
