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

Raymond G. Vickson

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




Related Items (78)

Sequencing games with controllable processing timesOne machine scheduling to minimize expected mean tardiness. IIA tabu-search heuristic for the flexible-resource flow shop scheduling problemScheduling identical parallel machines and operators within a period based changing modeApproximation schemes for parallel machine scheduling problems with controllable processing timesSingle-machine scheduling with trade-off between number of tardy jobs and compression costBicriteria robotic cell schedulingScheduling with controllable processing times and compression costs using population-based heuristicsIntroduction to QUBOSingle-machine scheduling with resource-dependent processing times and multiple unavailability periodsLoading and scheduling for flexible manufacturing systems with controllable processing timesA survey of scheduling with controllable processing timesMin-max regret version of a scheduling problem with outsourcing decisions under processing time uncertaintySingle-machine batch scheduling problem with job rejection and resource dependent processing timesA two-machine flow shop scheduling problem with controllable job processing timesConsidering manufacturing cost and scheduling performance on a CNC turning machineSingle machine scheduling problems with controllable processing times and total absolute differences penaltiesBatch scheduling of identical jobs with controllable processing timesSingle-machine scheduling with trade-off between number of tardy jobs and resource allocationSingle machine scheduling with discretely controllable processing timesOUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMESControllable processing times in project and production management: analysing the trade-off between processing times and the amount of resourcesA bicriterion approach to preemptive scheduling of parallel machines with controllable job processing timesSingle machine scheduling with resource allocation and learning effect considering the rate-modifying activityScheduling parallel CNC machines with time/cost trade-off considerationsSingle machine scheduling problem with controllable processing times and resource dependent release timesSingle-machine scheduling with learning considerationsPre-emptive scheduling problems with controllable processing timesMultiple and bicriteria scheduling: A literature surveySingle CNC machine scheduling with controllable processing times to minimize total weighted tardinessUnrelated parallel machine scheduling problem with special controllable processing times and setupsOptimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing timesTwo-machine flow shop scheduling with convex resource consumption functionsScheduling unrelated parallel machine problem with multi-mode processing times and batch delivery costA survey of results for sequencing problems with controllable processing timesSingle 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 sequencingSingle machine scheduling with total tardiness criterion and convex controllable processing timesProportionate flow shop with controllable processing timesA multi-objective approach to resource allocation in single machine schedulingA note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation modelsBicriteria robotic cell scheduling with controllable processing timesSingle machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programmingScheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysisScheduling jobs with controllable processing times as an optimal control problemSingle‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumptionResource cost aware schedulingA single-machine scheduling problem with uncertainty in processing times and outsourcing costsTradeoff between setup times and carrying costs for finished itemsApproximation schemes for job shop scheduling problems with controllable processing timesSingle machine scheduling with common due date and controllable processing timesSingle machine scheduling with resource dependent release times and processing timesMulticriteria scheduling problems: a surveyScheduling two agents with controllable processing timesA search method for optimal control of a flow shop system of traditional machinesOptimal control of production processes with variable execution timesPositive half-products and scheduling with controllable processing timesA \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing timesComplexity analysis of an assignment problem with controllable assignment costs and its applications in schedulingSingle machine common flow allowance scheduling with controllable processing timesSingle CNC machine scheduling with controllable processing times and multiple due datesA unified view of parallel machine scheduling with interdependent processing ratesMinimizing total tardiness on a single machine with controllable processing timesMinimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problemSingle machine scheduling subject to deadlines and resource dependent processing timesGenetic algorithms for the two-stage bicriteria flowshop problemSingle machine scheduling with controllable processing times and compression costs. I: Equal times and costsSingle machine scheduling with controllable processing times and compression costs. II: Proof and theoremsSingle machine scheduling with controllable processing times and compression costs. II: Heuristics for the general caseMulticriteria schedulingA new bounding mechanism for the CNC machine scheduling problems with controllable processing timesMinimization of the makespan in a two-machine problem under given resource constraintsSingle–machine scheduling with random machine breakdowns and randomly compressible processing timesTwo parallel machine sequencing problems involving controllable job processing timesAn approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing timesSingle 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