A Functional Equation and its Application to Resource Allocation and Sequencing Problems

DOI10.1287/mnsc.16.1.77zbMath0184.23303OpenAlexW2107216979WikidataQ56851486 ScholiaQ56851486MaRDI QIDQ5576138

No author found.

Publication date: 1969

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.16.1.77

zbMATH Keywords

operations research

Related Items

Scheduling lower bounds via AND subset sum, New algorithms for minimizing the weighted number of tardy jobs on a single machine, Minimizing the number of late jobs in a stochastic setting using a chance constraint, Optimal due date assignment in multi-machine scheduling environments, Faster minimization of tardy processing time on a single machine, Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property, Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs, Scheduling with batching: Minimizing the weighted number of tardy jobs, Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs, Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs, A parallel machine schedule updating game with compensations and clients averse to uncertain loss, Optimal restricted due date assignment in scheduling, A survey on single crane scheduling in automated storage/retrieval systems, Minimizing the weighted number of tardy jobs on a single machine with release dates, Batch delivery scheduling with batch delivery cost on a single machine, A binary multiple knapsack model for single machine scheduling with machine unavailability, A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date, Common due-date determination and sequencing using tabu search, A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\), Single machine total tardiness maximization problems: complexity and algorithms, Single machine scheduling to minimize the number of early and tardy jobs, A survey of single machine scheduling to minimize weighted number of tardy jobs, Single processor scheduling with job values depending on their completion times, Mimimization of agreeably weighted variance in single machine systems, Single machine batch scheduling with deadlines and resource dependent processing times, On an extension of the Sort \& Search method with application to scheduling theory, Single machine, scheduling problem with fuzzy precedence relation, A survey on offline scheduling with rejection, Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices, The symmetric quadratic knapsack problem: approximation and scheduling applications, The lazy bureaucrat scheduling problem, Toward a unified approach for the classification of NP-complete optimization problems, Parameterized multi-scenario single-machine scheduling problems, On bilevel machine scheduling problems, Dominance rules in combinatorial optimization problems, Scheduling with time-dependent discrepancy times, Fast approximation algorithm for job sequencing with deadlines, CON due-date determination and sequencing, A survey of results for sequencing problems with controllable processing times, A theory and algorithms for combinatorial reoptimization, A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios, A state-of-the-art review of parallel-machine scheduling research, Scheduling jobs with a V-shaped time-dependent processing time, A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs, Single-machine scheduling with maintenance activities and rejection, Minimizing tardy jobs in a flowshop with common due date, Minimizing functions of infeasibilities in a two-machine flow shop, A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates, 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, Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals, Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs, Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms, 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, Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem, Single-machine scheduling under the job rejection constraint, On the general solution for a class of early/tardy problems, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, 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, Scheduling with tool changes to minimize total completion time: Basic results and SPT performance, Reducing the degree of an interval polynomial, 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, Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments, 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, Single-machine scheduling with an external resource, Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem, Complexity results for flow shop problems with synchronous movement, FPTAS for half-products minimization with scheduling applications, On the minimization of total weighted flow time with identical and uniform parallel machines, Isomorphic scheduling problems, Delivery time quotation and order processing with forbidden early shipments, The selection and scheduling of textile orders with due dates, Scheduling jobs with agreeable processing times and due dates on a single batch processing machine, New results for scheduling to minimize tardiness on one machine with rejection and related problems, Single machine scheduling with batch deliveries, A note on a single machine scheduling problem with generalized total tardiness objective function, Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties, Parallel machine scheduling with a common server, Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan, Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances, Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs, A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines, Scheduling theory problems of type \(n|1|\sum c_i(t)\), Random sequencing jobs with deadlines problem: Growth of the optimal solution values, Two parallel machine sequencing problems involving controllable job processing times, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, A survey of the state-of-the-art of common due date assignment and scheduling research, Parallel machine scheduling to minimize costs for earliness and number of tardy jobs, Scheduling groups of unit length jobs on two identical parallel machines., Single machine batch scheduling problem with resource dependent setup and processing time in the presence of fuzzy due date, Scheduling with generalized and periodic due dates under single- and two-machine environments, Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization, Minimizing the weighted number of tardy jobs on a single machine, Minimizing the weighted number of tardy jobs on multiple machines: a review, Approximation algorithms for minimizing the total weighted tardiness on a single machine, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, Approximation schemes for a class of subset selection problems, 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, Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs, An exact extended formulation for the unrelated parallel machine total weighted completion time problem, Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times, Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work, Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work, Improving the solution complexity of the scheduling problem with deadlines: A general technique, Equivalence of some different maintenance activities in single-machine scheduling, Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty, Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs, Competitive two-agent scheduling with release dates and preemption on a single machine, New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives, Quick minimization of tardy processing time on a single machine, Polynomial-time data reduction for weighted problems beyond additive goal functions, A historical note on the complexity of scheduling problems, Single machine robust scheduling with budgeted uncertainty, On the complexity of scheduling problems with a fixed number of parallel identical machines, 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, A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching, Approximation algorithms for scheduling problems with a modified total weighted tardiness objective, Single machine scheduling with deadlines, release and due dates, Scheduling a two-stage flowshop under makespan constraint, Dynamic programming algorithms for scheduling parallel machines with family setup times, Minimizing maximum earliness on parallel identical machines, 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, Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals, Server cloud scheduling, 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, Algorithms for minclique scheduling problems, Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty