Pages that link to "Item:Q3896830"

The following pages link to Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine (Q3896830):

Displaying 50 items.

• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
• Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness (Q613514) (← links)
• Single machine scheduling with total tardiness criterion and convex controllable processing times (Q646664) (← links)
• A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models (Q660815) (← links)
• Tradeoff between setup times and carrying costs for finished items (Q690011) (← links)
• Single machine scheduling with resource dependent release times and processing times (Q704120) (← links)
• Sequencing games with controllable processing times (Q818079) (← links)
• Scheduling identical parallel machines and operators within a period based changing mode (Q833547) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563) (← links)
• Bicriteria robotic cell scheduling (Q835626) (← links)
• Considering manufacturing cost and scheduling performance on a CNC turning machine (Q856225) (← links)
• Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
• Scheduling parallel CNC machines with time/cost trade-off considerations (Q875425) (← links)
• Single machine scheduling problem with controllable processing times and resource dependent release times (Q877039) (← links)
• Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• A survey of results for sequencing problems with controllable processing times (Q908846) (← links)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• A search method for optimal control of a flow shop system of traditional machines (Q976446) (← links)
• Optimal control of production processes with variable execution times (Q977002) (← links)
• Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
• A two-machine flow shop scheduling problem with controllable job processing times (Q1104846) (← links)
• Single-machine scheduling with learning considerations (Q1124688) (← links)
• Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
• A bicriterion approach to time/cost trade-offs in sequencing (Q1162923) (← links)
• A multi-objective approach to resource allocation in single machine scheduling (Q1173857) (← links)
• Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming (Q1185994) (← links)
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis (Q1186948) (← links)
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem (Q1262204) (← links)
• Single machine scheduling subject to deadlines and resource dependent processing times (Q1278308) (← links)
• Genetic algorithms for the two-stage bicriteria flowshop problem (Q1278393) (← links)
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs (Q1288216) (← links)
• Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems (Q1288217) (← links)
• Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case (Q1288289) (← links)
• Minimization of the makespan in a two-machine problem under given resource constraints (Q1296091) (← links)
• Two parallel machine sequencing problems involving controllable job processing times (Q1310019) (← links)
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times (Q1310020) (← links)
• An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times (Q1319563) (← links)
• One machine scheduling to minimize expected mean tardiness. II (Q1332812) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988) (← links)
• Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
• Single machine scheduling with a variable common due date and resource-dependent processing times. (Q1413814) (← links)
• Single machine batch scheduling with jointly compressible setup and processing times. (Q1417506) (← links)
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
• Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity (Q1667833) (← links)
• Resource cost aware scheduling (Q1750475) (← links)
• Positive half-products and scheduling with controllable processing times (Q1772845) (← links)
• Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)