Single machine scheduling problems with controllable processing times and total absolute differences penalties
From MaRDI portal
Publication:856259
DOI10.1016/J.EJOR.2005.10.054zbMATH Open1109.90045OpenAlexW2037891938MaRDI QIDQ856259FDOQ856259
Authors: Ji-Bo Wang, Zun-Quan Xia 
Publication date: 7 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.054
Recommendations
- Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
- Single machine scheduling with common due date and controllable processing times
- Scheduling with controllable release dates and processing times: total completion time minimization
- Single machine common flow allowance scheduling with controllable processing times
- Multi-rule single machine scheduling with discretely controllable processing times
Cites Work
- Some comments on sequencing with controllable processing times
- A survey of results for sequencing problems with controllable processing times
- Title not available (Why is that?)
- A two-machine flow shop scheduling problem with controllable job processing times
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- A bicriterion approach to time/cost trade-offs in sequencing
- Two parallel machine sequencing problems involving controllable job processing times
- Variance Minimization in Single Machine Sequencing Problems
- Minimizing the Time-in-System Variance for a Finite Jobset
- Minimising Waiting Time Variance in the Single Machine Problem
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Minimizing Variation of Flow Time in Single Machine Systems
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Deterministic and Random Single Machine Sequencing with Variance Minimization
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- Resource optimal control in some single-machine scheduling problems
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- Single-machine sequencing with controllable processing times
- Single machine batch scheduling with jointly compressible setup and processing times.
Cited In (20)
- Single machine common flow allowance scheduling with controllable processing times
- Single-machine scheduling with time-and-resource-dependent processing times
- Single machine scheduling with common due date and controllable processing times
- Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times
- Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
- Title not available (Why is that?)
- Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- A survey of scheduling with controllable processing times
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- Multi-rule single machine scheduling with discretely controllable processing times
- Batch scheduling of identical jobs with controllable processing times
- Total absolute deviation of job completion times on uniform and unrelated machines
- Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
- Single-machine group scheduling with deteriorating jobs and allotted resource
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
- A note on resource allocation scheduling with position-dependent workloads
- Scheduling with controllable processing times and compression costs using population-based heuristics
This page was built for publication: Single machine scheduling problems with controllable processing times and total absolute differences penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856259)
