Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
From MaRDI portal
Publication:3896830
DOI10.1287/opre.28.5.1155zbMath0449.90054OpenAlexW2086679490MaRDI QIDQ3896830
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.5.1155
performance analysisheuristic algorithmcost minimizationprocessing timesoptimal job sequencejob sequencejob-processing costsingle machine sequencing problemweighted flow cost
Related Items (78)
Sequencing games with controllable processing times ⋮ One machine scheduling to minimize expected mean tardiness. II ⋮ A tabu-search heuristic for the flexible-resource flow shop scheduling problem ⋮ Scheduling identical parallel machines and operators within a period based changing mode ⋮ Approximation schemes for parallel machine scheduling problems with controllable processing times ⋮ Single-machine scheduling with trade-off between number of tardy jobs and compression cost ⋮ Bicriteria robotic cell scheduling ⋮ Scheduling with controllable processing times and compression costs using population-based heuristics ⋮ Introduction to QUBO ⋮ Single-machine scheduling with resource-dependent processing times and multiple unavailability periods ⋮ Loading and scheduling for flexible manufacturing systems with controllable processing times ⋮ A survey of scheduling with controllable processing times ⋮ Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty ⋮ Single-machine batch scheduling problem with job rejection and resource dependent processing times ⋮ A two-machine flow shop scheduling problem with controllable job processing times ⋮ Considering manufacturing cost and scheduling performance on a CNC turning machine ⋮ 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 ⋮ Single machine scheduling with discretely controllable processing times ⋮ OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT 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 ⋮ Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity ⋮ Scheduling parallel CNC machines with time/cost trade-off considerations ⋮ Single machine scheduling problem with controllable processing times and resource dependent release times ⋮ Single-machine scheduling with learning considerations ⋮ Pre-emptive scheduling problems with controllable processing times ⋮ Multiple and bicriteria scheduling: A literature survey ⋮ Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ Two-machine flow shop scheduling with convex resource consumption functions ⋮ Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost ⋮ 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 bicriterion approach to time/cost trade-offs in sequencing ⋮ Single machine scheduling with total tardiness criterion and convex controllable processing times ⋮ Proportionate flow shop with controllable processing times ⋮ A multi-objective approach to resource allocation in single machine scheduling ⋮ A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models ⋮ Bicriteria robotic cell scheduling with controllable processing times ⋮ Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming ⋮ Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis ⋮ Scheduling jobs with controllable processing times as an optimal control problem ⋮ Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption ⋮ Resource cost aware scheduling ⋮ A single-machine scheduling problem with uncertainty in processing times and outsourcing costs ⋮ Tradeoff between setup times and carrying costs for finished items ⋮ Approximation schemes for job shop scheduling problems with controllable processing times ⋮ 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 ⋮ Scheduling two agents with controllable processing times ⋮ A search method for optimal control of a flow shop system of traditional machines ⋮ Optimal control of production processes with variable execution times ⋮ Positive half-products and scheduling with controllable processing times ⋮ A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling ⋮ Single machine common flow allowance scheduling with controllable processing times ⋮ Single CNC machine scheduling with controllable processing times and multiple due dates ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ 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 subject to deadlines and resource dependent processing times ⋮ Genetic algorithms for the two-stage bicriteria flowshop problem ⋮ Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs ⋮ Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems ⋮ Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case ⋮ Multicriteria scheduling ⋮ A new bounding mechanism for the CNC machine scheduling problems with controllable processing times ⋮ 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 ⋮ Two parallel machine sequencing problems involving controllable job processing times ⋮ An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times ⋮ Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. ⋮ An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
This page was built for publication: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine