Two parallel machine sequencing problems involving controllable job processing times

DOI10.1016/0377-2217(93)90245-IzbMath0791.90028OpenAlexW2074801506MaRDI QIDQ1310019

Bahram Alidaee, Ahmad Ahmadian

Publication date: 20 December 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90245-i

zbMATH Keywords

polynomial time algorithmtransportation problemnon-identical machinescontrollable times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Sequencing games with controllable processing times ⋮ Scheduling with controllable processing times and compression costs using population-based heuristics ⋮ A survey of scheduling with controllable processing times ⋮ Single machine scheduling problems with controllable processing times and total absolute differences penalties ⋮ Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Single machine scheduling with discretely controllable processing times ⋮ OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES ⋮ Scheduling parallel CNC machines with time/cost trade-off considerations ⋮ Single-machine scheduling with learning considerations ⋮ A survey on offline scheduling with rejection ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ Scheduling a batching machine with convex resource consumption functions ⋮ A makespan minimization problem for versatile developers in the game industry ⋮ A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. ⋮ The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times ⋮ A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine ⋮ An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach ⋮ Single machine scheduling with common due date and controllable processing times ⋮ Single machine scheduling with resource dependent release times and processing times ⋮ Multicriteria scheduling problems: a survey ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ A unified approach for scheduling with convex resource consumption functions using positional penalties ⋮ A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times ⋮ Optimal control of production processes with variable execution times ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling ⋮ Minimizing completion time variance with compressible processing times ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ Multicriteria scheduling ⋮ Single–machine scheduling with random machine breakdowns and randomly compressible processing times ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research

Cites Work

• Unnamed Item
• A survey of results for sequencing problems with controllable processing times
• Solution structures and sensitivity of special assignment problems
• A two-machine flow shop scheduling problem with controllable job processing times
• 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
• The Factored Transportation Problem
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Scheduling independent tasks to reduce mean finishing time
• Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems