Single machine scheduling with discretely controllable processing times

DOI10.1016/S0167-6377(97)00010-2zbMATH Open0888.90088OpenAlexW2021910328MaRDI QIDQ1373460FDOQ1373460

Authors: Zhi-Long Chen, Qing Lu, Guochun Tang 

Publication date: 19 November 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00010-2

Recommendations

• Multi-rule single machine scheduling with discretely controllable processing times
• Batch delivery scheduling with discretely controllable processing times
• scientific article; zbMATH DE number 5630568
• Single machine scheduling with controllable release and processing parameters
• scientific article; zbMATH DE number 2044496

zbMATH Keywords

single machinemakespantotal completion timecontrollable processing timesmaximum tardinesspseudo-polynomial dynamic programming algorithmssum of the total processing cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Reducibility among combinatorial problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A survey of results for sequencing problems with controllable processing times
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• `` Strong NP-Completeness Results
• Sequencing with Earliness and Tardiness Penalties: A Review
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• A bicriterion approach to time/cost trade-offs in sequencing
• Two parallel machine sequencing problems involving controllable job processing times
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Scheduling Multiple Variable-Speed Machines
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
• Single-machine sequencing with controllable processing times
• Scheduling to minimize the total compression and late costs
• Flow Shop Scheduling with Resource Flexibility

Cited In (35)

• Single machine scheduling with a variable common due date and resource-dependent processing times.
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Scheduling two projects with controllable processing times in a single-machine environment
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost
• Title not available (Why is that?)
• A decomposition approach to job-shop scheduling problem with discretely controllable processing times
• A Review for Submodular Optimization on Machine Scheduling Problems
• Batch delivery scheduling with discretely controllable processing times
• Single machine scheduling with resource dependent release times and processing times
• A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
• Single machine batch scheduling with jointly compressible setup and processing times.
• Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times
• Single-machine sequencing with controllable processing times
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• Single machine batch scheduling with resource dependent setup and processing times
• A survey of scheduling with controllable processing times
• Single machine scheduling with total tardiness criterion and convex controllable processing times
• Single machine scheduling with controllable release and processing parameters
• Multi-rule single machine scheduling with discretely controllable processing times
• Considering manufacturing cost and scheduling performance on a CNC turning machine
• Title not available (Why is that?)
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
• Title not available (Why is that?)
• Two FPTAS algorithms of problem \(1|r_j\), dm\(|C_{\max}+TPC\)
• Single machine group scheduling with resource dependent setup and processing times
• Single machine scheduling problem with controllable processing times and resource dependent release times
• Minimizing total tardiness on a single machine with controllable processing times
• A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
• Title not available (Why is that?)
• Group scheduling with controllable setup and processing times: minimizing total weighted completion time
• Scheduling with discretely compressible release dates to minimize makespan
• Single-machine scheduling with machine unavailability periods and resource dependent processing times
• Approximation schemes for parallel machine scheduling problems with controllable processing times
• Approximation schemes for job shop scheduling problems with controllable processing times

This page was built for publication: Single machine scheduling with discretely controllable processing times

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