Scheduling dedicated jobs with variative processing times

DOI10.1007/S10878-014-9787-0zbMATH Open1339.90125OpenAlexW2088650722MaRDI QIDQ5963650FDOQ5963650

Erwin Pesch, Y. Shafransky, Maksim Barketau

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9787-0

Recommendations

• scientific article; zbMATH DE number 1264428
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
• The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
• Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness

zbMATH Keywords

bipartite graphinteger linear programmingNP-hardnessmaximal matchingrail-rail yard

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cites Work

• Assignment Problems
• Title not available (Why is that?)
• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• Title not available (Why is that?)
• Determining crane areas in intermodal transshipment yards: the yard partition problem
• Scheduling co-operating stacking cranes with predetermined container sequences

Cited In (8)

• Title not available (Why is that?)
• Scheduling with batching: Two job types
• Title not available (Why is that?)
• SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
• Title not available (Why is that?)
• Solving the single crane scheduling problem at rail transshipment yards
• Fixed-time schedules for the processing of jobs when service completions are not observable
• Scheduling jobs with varying processing times

Uses Software

• CPLEX

This page was built for publication: Scheduling dedicated jobs with variative processing times

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