A Functional Equation and its Application to Resource Allocation and Sequencing Problems
From MaRDI portal
Cited in
(only showing first 100 items - show all)- FPTAS for half-products minimization with scheduling applications
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
- Mimimization of agreeably weighted variance in single machine systems
- Toward a unified approach for the classification of NP-complete optimization problems
- Fast approximation algorithm for job sequencing with deadlines
- Scheduling to minimize weighted earliness and tardiness about a common due-date
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- A note on sequencing jobs with deadlines problem
- Optimal due-date assignment and sequencing
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- On the general solution for a class of early/tardy problems
- Reducing the degree of an interval polynomial
- Delivery time quotation and order processing with forbidden early shipments
- The selection and scheduling of textile orders with due dates
- Single machine scheduling with batch deliveries
- Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
- Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
- Random sequencing jobs with deadlines problem: Growth of the optimal solution values
- Two parallel machine sequencing problems involving controllable job processing times
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
- Single machine, scheduling problem with fuzzy precedence relation
- The lazy bureaucrat scheduling problem
- Parallel machine scheduling with a common server
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Scheduling groups of unit length jobs on two identical parallel machines.
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss
- Scheduling with time-dependent discrepancy times
- A theory and algorithms for combinatorial reoptimization
- Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs
- Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
- An exact approach for scheduling jobs with regular step cost functions on a single machine
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- On the single machine total tardiness problem
- Single machine scheduling to minimize total weighted tardiness
- Parameterized complexity of machine scheduling: 15 open problems
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Scheduling theory problems of type \(n|1|\sum c_i(t)\)
- Minimizing the weighted number of tardy jobs on a single machine
- Common due-date determination and sequencing using tabu search
- Single machine scheduling to minimize the number of early and tardy jobs
- Single machine batch scheduling with deadlines and resource dependent processing times
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios
- Minimizing tardy jobs in a flowshop with common due date
- Minimizing functions of infeasibilities in a two-machine flow shop
- Single-machine scheduling with an external resource
- New results for scheduling to minimize tardiness on one machine with rejection and related problems
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Scheduling with generalized and periodic due dates under single- and two-machine environments
- Scheduling lower bounds via AND subset sum
- Faster minimization of tardy processing time on a single machine
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- Parameterized multi-scenario single-machine scheduling problems
- Scheduling jobs with a V-shaped time-dependent processing time
- Single-machine scheduling with maintenance activities and rejection
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- Approximation schemes for a class of subset selection problems
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- Equivalence of some different maintenance activities in single-machine scheduling
- New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
- Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Scheduling a two-stage flowshop under makespan constraint
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Maximizing total tardiness on a single machine in O(n^2) time via a reduction to half-product minimization
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Polynomial-time data reduction for weighted problems beyond additive goal functions
- Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
- Improving the solution complexity of the scheduling problem with deadlines: a general technique
- Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
- Optimal restricted due date assignment in scheduling
- A survey on single crane scheduling in automated storage/retrieval systems
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- Single machine total tardiness maximization problems: complexity and algorithms
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- On an extension of the Sort \& Search method with application to scheduling theory
- A survey on offline scheduling with rejection
- On bilevel machine scheduling problems
- Dominance rules in combinatorial optimization problems
- Single machine scheduling with deadlines, release and due dates
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
This page was built for publication: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576138)
