Scheduling dedicated jobs with variative processing times

DOI10.1007/S10878-014-9787-0MaRDI QIDQ5963650zbMATH OpenOpenAlexFDO

Authors Maksim Barketau, Erwin Pesch, Y. Shafransky

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

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)

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

Cites work

• scientific article; zbMATH DE number 724323 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Assignment Problems
• Determining crane areas in intermodal transshipment yards: the yard partition problem
• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• Scheduling co-operating stacking cranes with predetermined container sequences

Cited in

(8)

• scientific article; zbMATH DE number 1948448 (Why is no real title available?)
• Scheduling with batching: Two job types
• scientific article; zbMATH DE number 2159168 (Why is no real title available?)
• SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
• scientific article; zbMATH DE number 4079152 (Why is no real title available?)
• 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

Describes a project that uses

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)