Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine

DOI10.1287/OPRE.28.5.1155MaRDI QIDQ3896830zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

cost minimizationheuristic algorithmjob sequencejob-processing costoptimal job sequenceperformance analysisprocessing timessingle machine sequencing problemweighted flow cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited in

(87)

• Minimizing total tardiness on a single machine with controllable processing times
• A two-machine flow shop scheduling problem with controllable job processing times
• Single-machine scheduling with learning considerations
• Multiple and bicriteria scheduling: A literature survey
• A bicriterion approach to time/cost trade-offs in sequencing
• A multi-objective approach to resource allocation in single machine scheduling
• 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
• 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
• Minimization of the makespan in a two-machine problem under given resource constraints
• 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
• An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
• One machine scheduling to minimize expected mean tardiness. II
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Single machine scheduling with discretely 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.
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
• Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity
• Resource cost aware scheduling
• Positive half-products and scheduling with controllable processing times
• Approximation schemes for parallel machine scheduling problems with controllable processing times
• A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
• Proportionate flow shop with controllable processing times
• A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
• Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• A unified view of parallel machine scheduling with interdependent processing rates
• A tabu-search heuristic for the flexible-resource flow shop scheduling problem
• A survey of scheduling with controllable processing times
• Approximation schemes for job shop scheduling problems with controllable processing times
• Single machine scheduling with common due date and controllable processing times
• Single machine common flow allowance scheduling with controllable processing times
• Multicriteria scheduling
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• Unrelated parallel machine scheduling problem with special controllable processing times and setups
• Multicriteria scheduling problems: a survey
• Outsourcing decisions in m-machine permutation flow shop scheduling problems with machine-dependent processing times
• Bicriteria robotic cell scheduling with controllable processing times
• Scheduling with controllable processing times and compression costs using population-based heuristics
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
• Scheduling jobs with controllable processing times as an optimal control problem
• Batch scheduling of identical jobs with controllable processing times
• Single CNC machine scheduling with controllable processing times and multiple due dates
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times
• Single-machine batch scheduling problem with job rejection and resource dependent processing times
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• Introduction to QUBO
• Loading and scheduling for flexible manufacturing systems with controllable processing times
• A 32-approximation algorithm for parallel machine scheduling with 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
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
• Single machine scheduling with total tardiness criterion and convex controllable processing times
• A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
• A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models
• A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
• Theory and methodology of time-dependent scheduling: past, present and future
• Bicriteria permutation flow shop scheduling problems with machine-dependent convex resource consumption functions
• Minimizing total completion time in single-machine scheduling with convex resource consumption and job rejection
• Fifty years of research in scheduling -- theory and applications
• Tradeoff between setup times and carrying costs for finished items
• Single machine scheduling with resource dependent release times and processing times
• Coordinating scheduling and resource allocation decisions in a proportionate flow-shop scheduling environment
• A preemptive single-machine scheduling problem with a late work criterion and convex resource consumption functions
• Total weighted completion time scheduling under resource allocation and time-dependent learning effects
• Sequencing games with controllable processing times
• Scheduling identical parallel machines and operators within a period based changing mode
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost
• Bicriteria robotic cell scheduling
• Considering manufacturing cost and scheduling performance on a CNC turning machine
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• Scheduling parallel CNC machines with time/cost trade-off considerations
• Single machine scheduling problem with controllable processing times and resource dependent release times
• Pre-emptive scheduling problems with controllable processing times
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times
• A survey of results for sequencing problems with controllable processing times
• 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

This page was built for publication: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3896830)