Single machine scheduling with total tardiness criterion and convex controllable processing times

DOI10.1007/S10479-010-0827-6zbMATH Open1225.90058OpenAlexW1978460437MaRDI QIDQ646664FDOQ646664

Authors: Kailiang Xu, Liangjun Ke, Zuren Feng 

Publication date: 17 November 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0827-6

Recommendations

• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• Single machine scheduling problem with controllable processing time and setup under convex resource consumption costs
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
• Single machine scheduling with discretely controllable processing times
• scientific article; zbMATH DE number 2051966
• Minimizing total tardiness on a single machine with controllable processing times
• scientific article; zbMATH DE number 6177807
• Single machine due-window assignment and scheduling with controllable processing times
• SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION

zbMATH Keywords

single machineconvex resource consumption functiontotal tardiness criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• A survey of scheduling with controllable processing times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing Total Tardiness on One Machine is NP-Hard
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Multiple-machine scheduling with earliness, tardiness and completion time penalties
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Title not available (Why is that?)
• A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
• Parallel machine scheduling with a convex resource consumption function

Cited In (21)

• Research on permutation flow shop scheduling problems with general position-dependent learning effects
• Some results of the worst-case analysis for flow shop scheduling with a learning effect
• Two-machine flow shop scheduling with convex resource consumption functions
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
• Title not available (Why is that?)
• Single machine scheduling problem with controllable processing time and setup under convex resource consumption costs
• A unified approach for scheduling with convex resource consumption functions using positional penalties
• Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
• Throughput optimization for the robotic cell problem with controllable processing times
• Unrelated parallel machine scheduling problem with special controllable processing times and setups
• A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
• Title not available (Why is that?)
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Resource cost aware scheduling
• A note on a single machine scheduling problem with generalized total tardiness objective function

This page was built for publication: Single machine scheduling with total tardiness criterion and convex controllable processing times

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