A bicriterion approach to time/cost trade-offs in sequencing
From MaRDI portal
Publication:1162923
DOI10.1016/S0377-2217(82)80008-8zbMath0482.90043MaRDI QIDQ1162923
Kenneth R. Baker, Luk N. Van Wassenhove
Publication date: 1982
Published in: European Journal of Operational Research (Search for Journal in Brave)
resource allocationsequencingbicriterion approachminimization of maximum completion penaltysingle-machine modeltime/cost trade-offs
Related Items
Two machine open shop scheduling problems with bi-criteria, An interactive procedure for bi-criteria production scheduling, Incorporating preference information into multi-objective scheduling, Convex resource allocation for minimizing the makespan in a single machine with job release dates, A tabu-search heuristic for the flexible-resource flow shop scheduling problem, Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine, Minimizing the total weighted flow time in a single machine with controllable processing times, Single machine batch scheduling to minimize total completion time and resource consumption costs, Single-machine scheduling with trade-off between number of tardy jobs and compression cost, Bicriteria robotic cell scheduling, A bicriterion scheduling problem involving total flowtime and total tardiness, Scheduling with controllable processing times and compression costs using population-based heuristics, Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach, Multicriteria scheduling using fuzzy theory and tabu search, A survey of scheduling with controllable processing times, Single machine scheduling with rejection to minimize the weighted makespan, Single machine scheduling problems with controllable processing times and total absolute differences penalties, Batch scheduling of identical jobs with controllable processing times, Single-machine scheduling with trade-off between number of tardy jobs and resource allocation, A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness, Single machine scheduling with discretely controllable processing times, Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources, A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times, Pre-emptive scheduling problems with controllable processing times, Multiple and bicriteria scheduling: A literature survey, Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost, Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan, A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure, Single machine scheduling with controllable release and processing parameters, Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine, A survey of results for sequencing problems 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., A state-of-the-art review of parallel-machine scheduling research, Unnamed Item, Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time, A multi-objective approach to resource allocation in single machine scheduling, The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times, Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis, Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption, A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine, Resource cost aware scheduling, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Use of variable range in solving multiple criteria scheduling problems, A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates, Single machine scheduling with common due date and controllable processing times, Single machine scheduling with resource dependent release times and processing times, Multicriteria scheduling problems: a survey, Just-in-time scheduling with controllable processing times on parallel machines, Parallel machine scheduling with a convex resource consumption function, Scheduling two agents with controllable processing times, Group scheduling with controllable setup and processing times: minimizing total weighted completion time, Single machine common flow allowance scheduling with controllable processing times, Minimizing total tardiness on a single machine with controllable processing times, Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem, SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION, Genetic algorithms for the two-stage bicriteria flowshop problem, Scheduling unit processing time jobs on a single machine with multiple criteria, Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs, Multicriteria scheduling, Minimization of the makespan in a two-machine problem under given resource constraints, Single–machine scheduling with random machine breakdowns and randomly compressible processing times, Finding the Pareto-optima for the total and maximum tardiness single machine problem, An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times, An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times, An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note
Cites Work
